Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract (2000)

by Roberto Grossi , Jeffrey , Scott Vitter
Venue:in Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing
Citations:189 - 17 self

Documents Related by Co-Citation

646 Suffix arrays: A new method for on-line string searches – Udi Manber, Argo Gene Myerst - 1993
179 Opportunistic Data Structures with Applications – Paolo Ferragina, Giovanni Manzini - 2000
142 Succinct Representation of Balanced Parentheses, Static Trees and Planar Graphs – J. Ian Munro, Venkatesh Raman, J. Ian, Munro Venkatesh Raman - 1999
568 A block-sorting lossless data compression algorithm – M. Burrows, D. J. Wheeler, M. Burrows, D. J. Wheeler - 1994
65 An Experimental Study of an Opportunistic Index – Paolo Ferragina, Giovanni Manzini - 2001
191 Succinct indexable dictionaries with applications to encoding k-ary trees and multisets – Rajeev Raman, Venkatesh Raman, S. Srinivasa Rao
550 A space-economical suffix tree construction algorithm – E M McCreight - 1976
61 Compressed text databases with efficient query algorithms based on the compressed suffix array – Kunihiko Sadakane - 2000
172 Space-efficient static trees and graphs – G Jacobson - 1989
55 Space Efficient Suffix Trees – Ian Munro, Venkatesh Raman, S. Srinivasa Rao - 1998
133 An Analysis of the Burrows-Wheeler Transform – Giovanni Manzini - 2001
118 Reducing the Space Requirement of Suffix Trees – Stefan Kurtz - 1999
51 Succinct Representations of lcp Information and Improvements in the Compressed Suffix Arrays – Kunihiko Sadakane - 2002
194 High-order entropy-compressed text indexes – Roberto Grossi, Ankur Gupta, Jeffrey Scott Vitter - 2003
426 Linear pattern matching algorithms – P Weiner - 1973
22 On compressing and indexing data – P Ferragina, G Manzini
40 New indices for text – G Gonnet, R Baeza-Yates, T Snider - 1992
15 Compressed sux arrays and sux trees with applications to text indexing and string matching – R Grossi, J S Vitter - 2000
129 Optimal Suffix Tree Construction with Large Alphabets – Martin Farach - 1997