A fast bit-vector algorithm for approximate string matching based on dynamic programming

Journal of the ACM

Volumn 46, Issue 3, 1999, Pages 395-415

  Myers, Gene ^a,b  

^a UNIVERSITY OF ARIZONA   (United States)

^b CELERA GENOMICS   (United States)

Author keywords

Approximate string search; Bit parallelism; Sequence comparison

Indexed keywords

APPROXIMATE STRING SEARCH; BIT-PARALLELISM; BIT-VECTOR ALGORITHMS; SEQUENCE COMPARISON;

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

DYNAMIC PROGRAMMING;

EID: 0000541351     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/316542.316550     Document Type: Article

References (23)

1. BAEZA-YATES, R. A., AND GONNET, G. H. 1992. A new approach to text searching. Commun. ACM 35, 74-82.
2. BAEZA-YATES, R. A., AND NAVARRO, G. 1996. A faster algorithm for approximate string matching. In Proceedings of the 7th Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, Vol. 1075. Springer-Verlag, New York, pp. 1-23.
3. BAEZA-YATES, R. A. AND NAVARRO, G. 1999. Analysis for algorithm engineering: Improving an algorithm for approximate pattern matching. Unpublished manuscript.
4. CHAD, K. M., HARDISON, R. C., AND MILLER, W. 1992. Recent developments in linear-space alignment methods: A survey. J. Comput. Biol. 1, 271-291.
5. CHANG, W. I., AND LAMPE, J. 1992. Theoretical and empirical comparisons of approximate string matching algorithms. In Proceedings of the 3rd Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 644. Springer-Verlag, New York, pp. 172-181.
6. CHANG, W. I. AND LAWLER, E. L. 1994. Sublinear expected time approximate matching and biological applications. Algorithmica 12, 327-344.
7. CHAD, K. M., HARDISON, R. C., AND MILLER, W. 1992. Recent developments in linear-space alignment methods: A survey. J. Comput. Biol. 1, 271-291.
8. CHAO, K. M., PEARSON, W. R., AND MILLER, W. 1992. Aligning two sequences within a specified diagonal band. Comput. Appl. BioSciences 8, 481-487.
9. COBBS, A. 1995. Fast approximate matching using suffix trees. In Proceedings of the 6th Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 937. Springer-Verlag, New York, pp. 41-54.
10. GALIL, Z., AND PARK, K. 1990. An improved algorithm for approximate string matching. SIAM J. Comput. 19, 989-999.
11. LANDAU, G. M., AND VISHKIN, U. 1988. Fast string matching with k differences. J. Comput. Syst. Sci. 37, 63-78.
12. MASEK, W. J., AND PATERSON, M. S. 1980. A faster algorithm for computing string edit distances. J. Comput. Syst. Sci. 20, 18-31.
13. MYERS, E. W. 1994. A sublinear algorithm for approximate keywords searching. Algorithmica 12, 345-374.
14. PEVZNER, P., AND WATERMAN, M. S. 1995. Multiple filtration and approximate pattern matching. Algorithmica 13, 135-154.
15. SELLERS, P. H. 1980. The theory and computations of evolutionary distances: Pattern recognition. J. Algorithms 1, 359-373.
16. SUTINEN, E., AND TARHIO, J. 1996. Filtration with q-samples in approximate string matching. In Proceedings of the 7th Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 1075. Springer-Verlag, New York, pp. 50-63.
17. UKKONEN, E. 1985. Finding approximate patterns in strings. J. Algorithms 6, 132-137.
18. UKKONEN, E. 1992. Approximate string-matching with q-grams and maximal matches. Theoret. Comput. Sci. 92, 191-211.
19. UKKONEN, E. 1993. Approximate string matching over suffix trees. In Proceedings of the 4th Symposium on Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 684. Springer-Verlag, New York, pp. 228-242.
20. WAGNER, R. A., AND FISCHER, M. J. 1974. The string to string correction problem. J. ACM 21, 168-173.
21. WU, S., AND MANBER, U. 1992. Fast text searching allowing errors. Commun. ACM 35, 10, 83-91.
22. WU, S., MANBER, U., AND MYERS, G. 1996. A subquadratic algorithm for approximate limited expression matching. Algorithmica 15, 50-67.
23. WRIGHT, A. H. 1994. Approximate string matching using within-word parallelism. Soft. Pract. Exper. 24, 337-362.