Reducing the Space Requirement of Suffix Trees (1999)

by Stefan Kurtz
Venue:Software – Practice and Experience
Citations:130 - 12 self

Documents Related by Co-Citation

673 Suffix arrays: A new method for on-line string searches – Udi Manber, Argo Gene Myerst - 1993
568 A space economical suffix tree construction algorithm – E M McCreight - 1976
596 A block-sorting lossless data compression algorithm – M. Burrows, D. J. Wheeler - 1994
192 Compressed suffix arrays and suffix trees with applications to text indexing and string matching – Roberto Grossi, Jeffrey Scott Vitter - 2005
953 Algorithms on strings, trees, and sequences – D Gusfield - 1997
445 pattern matching algorithms – Peter Weiner - 1972
189 Opportunistic Data Structures with Applications – Paolo Ferragina, Giovanni Manzini - 2000
644 Modeling for text compression – T Bell, I H Witten, J G Cleary - 1989
776 Compression of Individual Sequences via Variable-Rate Coding – Jacob Ziv, Abraham Lempel - 1978