Faster bit-parallel approximate string matching

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

Volumn 2373, Issue , 2002, Pages 203-224

  Hyyrö, Heikki ^a   Navarro, Gonzalo ^b  

^a TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ALPHABET SIZE; APPROXIMATE SEARCHING; APPROXIMATE STRING MATCHING; COMPUTATIONAL BIOLOGY; EXACT ALGORITHMS; NATURAL LANGUAGES; SUBLINEAR TIME; TIME ALGORITHMS;

PATTERN MATCHING;

EID: 84870629159     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45452-7_18     Document Type: Conference Paper

References (22)

1. R. Baeza-Yates. Text retrieval: Theory and practice. In 12th IFIP World Computer Congress, volume 1, pages 465–476. Elsevier Science, 1992.
2. R. Baeza-Yates. A unified view of string matching algorithms. In Proc. Theory and Practice of Informatics (SOFSEM’96), LNCS 1175, pages 1–15, 1996.
3. R. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127–158, 1999.
4. W. Chang and J. Lampe. Theoretical and empirical comparisons of approximate string matching algorithms. In Proc. 3rd Combinatorial Pattern Matching (CPM’92), LNCS 644, pages 172–181, 1992.
5. W. Chang and T. Marr. Approximate string matching and local similarity. In Proc. 5th Combinatorial Pattern Matching (CPM’94), LNCS 807, pages 259–273, 1994.
6. M. Crochemore and W. Rytter. Text Algorithms. Oxford University Press, Oxford, UK, 1994.
7. Z. Galil and K. Park. An improved algorithm for approximate string matching. SIAM Journal on Computing, 19(6):989–999, 1990.
8. H. Hyyrö. Explaining and extending the bit-parallel algorithm of Myers. Technical Report A-2001-10, University of Tampere, Finland, 2001.
9. G. Landau and U. Vishkin. Fast parallel and serial approximate string matching. Journal of Algorithms, 10:157–169, 1989.
10. G. Myers. A fast bit-vector algorithm for approximate string matching based on dynamic progamming. Journal of the ACM, 46(3):395–415, 1999.
11. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31–88, 2001.
12. G. Navarro and R. Baeza-Yates. Very fast and simple approximate string matching. Information Processing Letters, 72:65–70, 1999.
13. G. Navarro and R. Baeza-Yates. Improving an algorithm for approximate string matching. Algorithmica, 30(4):473–502, 2001.
14. G. Navarro and M. Raffinot. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA), 5(4), 2000.
15. G. Navarro and M. Raffinot. Flexible Pattern Matching in Strings – Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, 2002. To appear.
16. P. Sellers. The theory and computation of evolutionary distances: pattern recognition. Journal of Algorithms, 1:359–373, 1980.
17. E. Sutinen and J. Tarhio. On using q-gram locations in approximate string matching. In Proc. European Symposium on Algorithms (ESA’95), LNCS 979, pages 327–340, 1995.
18. J. Tarhio and E. Ukkonen. Approximate Boyer-Moore string matching. SIAM Journal on Computing, 22(2):243–260, 1993.
19. E. Ukkonen. Algorithms for approximate string matching. Information and Control, 64:100–118, 1985.
20. E. Ukkonen. Finding approximate patterns in strings. Journal of Algorithms, 6:132–137, 1985.
21. S. Wu and U. Manber. Fast text searching allowing errors. Comm. of the ACM, 35(10):83–91, 1992.
22. S. Wu, U. Manber, and G. Myers. A sub-quadratic algorithm for approximate limited expression matching. Algorithmica, 15(1):50–67, 1996.