Approximate String Matching with Compressed Indexes

@article{Russo2009ApproximateSM,
  title={Approximate String Matching with Compressed Indexes},
  author={Lu{\'i}s M. S. Russo and Gonzalo Navarro and Arlindo L. Oliveira and Pedro Morales},
  journal={Algorithms},
  year={2009},
  volume={2},
  pages={1105-1136}
}
A compressed full-text self-index for a text T is a data structure requiring reduced space and able to search for patterns P in T . It can also reproduce any substring of T , thus actually replacing T . Despite the recent explosion of interest on compressed indexes, there has not been much progress on functionalities beyond the basic exact search. In this paper we focus on indexed approximate string matching (ASM), which is of great interest, say, in bioinformatics. We study ASM algorithms for… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-10 of 29 extracted citations

References

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

Indexing methods for approximate string matching

  • G. Navarro, R. Baeza-Yates, E. Sutinen, J. Tarhio
  • IEEE Data Eng. Bull. 2001,
  • 2001
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…