资 源 简 介
The current library implements an Enhanced Suffix Array (Abouelhoda et al. 2004) and a Linearized Suffix Tree (Kim et al. 2008). It is designed with a flexible API in mind allowing for any type of underlying sequences, sorting algorithms etc. to be used. In addition, an implementation of a so-called Embedded Suffix Tree is provided which could be used to discover discontinuous (gappy) repeats. A basic vector-space-model-based aligner is included for repeat alignment.
