Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes

@inproceedings{Ohlebusch2010ComputingMS,
  title={Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes},
  author={Enno Ohlebusch and Simon Gog and Adrian K{\"u}gel},
  booktitle={SPIRE},
  year={2010}
}
Exact string matching is a problem that computer programmers face on a regular basis, and full-text indexes like the suffix tree or the suffix array provide fast string search over large texts. In the last decade, research on compressed indexes has flourished because the main problem in large-scale applications is the space consumption of the index. Nowadays, the most successful compressed indexes are able to obtain almost optimal space and search time simultaneously. It is known that a myriad… CONTINUE READING
22 Citations
20 References
Similar Papers

Similar Papers

Loading similar papers…