Practical Compressed Suffix Trees
AbstractThe suffix tree is an extremely important data structure in bioinformatics. Classical implementations require much space, which renders them useless to handle large sequence collections. Recent research has obtained various compressed representations for suffix trees, with widely different space-time tradeoffs. In this paper we show how the use of range min-max trees yields novel representations achieving practical space/time tradeoffs. In addition, we show how those trees can be modified to index highly repetitive collections, obtaining the first compressed suffix tree representation that effectively adapts to that scenario. View Full-Text
Share & Cite This Article
Abeliuk, A.; Cánovas, R.; Navarro, G. Practical Compressed Suffix Trees. Algorithms 2013, 6, 319-351.
Abeliuk A, Cánovas R, Navarro G. Practical Compressed Suffix Trees. Algorithms. 2013; 6(2):319-351.Chicago/Turabian Style
Abeliuk, Andrés; Cánovas, Rodrigo; Navarro, Gonzalo. 2013. "Practical Compressed Suffix Trees." Algorithms 6, no. 2: 319-351.