Bit-parallel approximate string matching algorithms with transposition

Journal of Discrete Algorithms

Volumn 3, Issue 2-4, 2005, Pages 215-229

  Hyyrö, Heikki ^a  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

Approximate string matching; Bit parallelism; Damerau edit distance; Levenshtein edit distance

Indexed keywords

COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; COMPUTER SYSTEMS PROGRAMMING; FINITE AUTOMATA; PATTERN MATCHING; PROBLEM SOLVING;

APPROXIMATE STRING MATCHING; BIT-PARALLELISM; DAMERAU EDIT DISTANCE; LEVENSHTEIN EDIT DISTANCE;

PARALLEL ALGORITHMS;

EID: 18544373357     PISSN: 15708667     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.jda.2004.08.006     Document Type: Conference Paper

References (23)

1. R. Baeza-Yates, and G. Gonnet A new approach to text searching Comm. ACM 35 10 1992 74 82
2. R. Baeza-Yates, and G. Navarro Faster approximate string matching Algorithmica 23 2 1999 127 158
3. F. Damerau A technique for computer detection and correction of spelling errors Comm. ACM 7 3 1964 171 176
4. M.W. Du, and S.C. Chang A model and a fast algorithm for multiple errors spelling correction Acta Informatica 29 1992 281 302
5. D. Harman Overview of the third text REtrieval conference Proc. Third Text REtrieval Conference (TREC-3) 1995 1 19 NIST Special Publication 500-207
6. J. Holub, Simulation of nondeterministic finite automata in pattern matching, PhD Thesis, Dept. of Computer Science and Engineering, Czech Technical University, Prague, February 2000
7. H. Hyyrö, Explaining and extending the bit-parallel approximate string matching algorithm of Myers, Technical Report A-2001-10, Dept. of Computer and Information Sciences, University of Tampere, Tampere, Finland, 2001
8. H. Hyyrö Bit-parallel approximate string matching with transposition Proc. 10th International Symposium on String Processing and Information Retrieval (SPIRE'2003) Lecture Notes in Comput. Sci. 2003
9. H. Hyyrö, and G. Navarro Faster bit-parallel approximate string matching Proc. 13th Combinatorial Pattern Matching (CPM'2002) Lecture Notes in Comput. Sci. vol. 2373 2002 203 224
10. K. Kukich Techniques for automatically correcting words in text ACM Comput. Surv. 24 4 1992 377 439
11. V. Levenshtein Binary codes capable of correcting deletions, insertions and reversals Soviet Phys. Dokl. 10 8 1966 707 710
12. Original in Russian in Dokl. Akad. Nauk SSSR 163 4 1965 845 848
13. G. Myers A fast bit-vector algorithm for approximate string matching based on dynamic programming J. ACM 46 3 1999 395 415
14. G. Navarro A guided tour to approximate string matching ACM Comput. Surv. 33 1 2001 31 88
15. G. Navarro NR-grep: a fast and flexible pattern matching tool Software Practice and Experience (SPE) 31 2001 1265 1312
16. G. Navarro, and R. Baeza-Yates Improving an algorithm for approximate pattern matching Algorithmica 30 4 2001 473 502
17. G. Navarro, and M. Raffinot Flexible Pattern Matching in Strings - Practical On-line Search Algorithms for Texts and Biological Sequences 2002 Cambridge University Press 0-521-81307-7 280 pages
18. P. Sellers The theory and computation of evolutionary distances: pattern recognition J. Algorithms 1 1980 359 373
19. Esko Ukkonen Algorithms for approximate string matching Inform. and Control 64 1985 100 118
20. Esko Ukkonen Finding approximate patterns in strings J. Algorithms 6 1985 132 137
21. A. Wright Approximate string matching using within-word parallelism Software Practice and Experience 24 4 1994 337 362
22. S. Wu, and U. Manber Agrep - a fast approximate pattern-matching tool Proc. USENIX Technical Conference 1992 153 162
23. S. Wu, and U. Manber Fast text searching allowing errors Comm. ACM 35 10 1992 83 91