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

@inproceedings{Grossi2000CompressedSA,
  title={Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)},
  author={Roberto Grossi and Jeffrey Scott Vitter},
  booktitle={STOC},
  year={2000}
}
The proliferation of online text, such as on the World Wide Web and in databases, motivates the need for space-efficient index methods that support fast search. Consider a text T of n binary symbols to index. Given any query pattern P of m binary symbols, the goal is to search f?r P in T quickly, with T being fully scanned only once, nafiaely, when the index is created. All indexing schemes published in the last thirty years support searching in O(m) worst-case time and require O(n) memory… CONTINUE READING
Highly Cited
This paper has 68 citations. REVIEW CITATIONS
38 Citations
12 References
Similar Papers

Citations

Publications citing this paper.

68 Citations

051015'00'03'07'11'15
Citations per Year
Semantic Scholar estimates that this publication has 68 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Succinct static data structures

  • G. Jacobson
  • Technical Report CMU-CS-89-112, Dept. of Computer…
  • 1989
Highly Influential
6 Excerpts

Similar Papers

Loading similar papers…