Indexing structures for approximate string matching

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2653, Issue , 2003, Pages 140-151

  Gabriele, Alessandra ^a   Mignosi, Filippo ^a   Restivo, Antonio ^a   Sciortino, Marinella ^a  

^a UNIVERSITY OF PALERMO   (Italy)

Author keywords

Approximate string matching; Automata theory; Combinatorics on words; DAWGs; Indexing; Suffix trees

Indexed keywords

AUTOMATA THEORY; COMPUTATIONAL COMPLEXITY; HAMMING DISTANCE; INDEXING (OF INFORMATION);

APPROXIMATE STRING MATCHING; COMBINATORICS ON WORDS; DAWGS; INDEXING STRUCTURES; SUFFIX-TREES; TIME SPENT;

ALGORITHMS;

EID: 26444594769     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44849-7_20     Document Type: Article

References (10)

1. A. Amir, D. Keselman, G. M. Landau, M. Lewenstein, N. Lewenstein, and M. Rodeh. Indexing and dictionary matching with one error. LLNCS, 1663:181-190, 1999.
2. R. Arratia and M. Waterman. The erd'os-rényi strong law for pattern matching with given proportion of mismatches. Annals of Probability, 4:200-225, 1989.
3. R. B. Ash. Information Theory. Interscience, 1965.
4. M. Crochemore, C. Hancart, and T. Lecroq. Algorithmique du texte. Vuibert, 2001. 347 pages.
5. A. Gabriele, F. Mignosi, A. Restivo, and M. Sciortino. Indexing structure for approximate string matching. Technical Report 169, University of Palermo, Department of Mathematics and Applications, 2002.
6. Z. Galil and R. Giancarlo. Data structures and algorithms for approximate string matching. Journal of Complexity, 24:33-72, 1988.
7. D. Gusfield. Algorithms on Strings, Trees, and Sequences. Cambridge University Press, 1997. ISBN 0 521 58519 8 hardback. 534 pages.
8. S. Muthukrishnan. Efficient algorithms for document retrieval problems. In Proceedings of the 13th Annual ACM-SIAM Sumposium on Discrete Algorithms, pages 657-666, 2002.
9. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
10. G. Navarro, R. Baeza-Yates, E. Sutinen, and J. Tarhio. Indexing methods for approximate string matching. IEEE Data Engineering Bulletin, 24(4):19-27, 2001. Special issue on Managing Text Natively and in DBMSs. Invited paper.