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

Document Versions

Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract –Roberto Grossi, Jeffrey, Scott Vitter — 2000 — in Proceedings of the 32nd Annual ACM Symposium on the Theory of Computing
Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching (Extended Abstract) –Roberto Grossi, Jeffrey Scott Vitter — 2000 — SIAM Journal on Computing