Increased bit-parallelism for approximate and multiple string matching

ACM Journal of Experimental Algorithmics

Volumn 10, Issue , 2005, Pages

  Hyyrö, Heikki ^b   Fredriksson, Kimmo ^a,c   Navarro, Gonzalo ^d  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

^b TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

^c Department of Computer Science and Statistics ^*  (Finland)

^d UNIVERSITY OF CHILE   (Chile)

Author keywords

Approximate string matching; Bit parallelism; Multiple string matching

Indexed keywords

EID: 78650482007     PISSN: 10846654     EISSN: None     Source Type: Journal    
DOI: 10.1145/1064546.1180617     Document Type: Article

References (27)

1. AHO, A. AND CORASICK, M. 1975. Efficient string matching: an aid to bibliographic search. Communications of the ACM 18, 6, 333-340.
2. ALLAUZEN, C. AND RAFFINOT, M. 1999. Factor oracle of a set of words. Technical Report 99-11, Institut Gaspard-Monge, Université de Marne-la-Vallée.
3. ALLISON, L. AND DIX, T. L. 1986. A bit-string longest common subsequence algorithm. Information Processing Letters 23, 305-310.
4. BAEZA-YATES, R. AND GONNET, G. 1992. A new approach to text searching. Communications of the ACM 35, 10, 74-82.
5. BAEZA-YATES, R. AND NAVARRO, G. 1999. Faster approximate string matching. Algorithmica 23, 2, 127-158.
6. CROCHEMORE, M., ILIOPOULOS, C. S., PINZON, Y. J., AND REID, J. F. 2001. A fast and practical bit-vector algorithm for the longest common subsequence problem. Information Processing Letters 80, 279-285.
7. th International Symposium on String Processing and Information Retrieval (SPIRE '03). LNCS 2857. Berlin, Germany, Springer, New York. 66-79.
8. FREDRIKSSON, K. AND NAVARRO, G. 2004. Average-optimal single and multiple approximate string matching. ACM Journal of Experimental Algorithmics (JEA). 9, 1.4.
9. HORSPOOL, R. N. 1980. Practical fast searching in strings. Software Practice and Experience 10, 6, 501-506.
10. HYYRÖ, H. 2001. Explaining and extending the bit-parallel approximate string matching algorithm of Myers. Tech. Rep. A-2001-10, Department of Computer and Information Sciences, University of Tampere, Tampere, Finland.
11. HYYRÖ, H. 2003. A bit-vector algorithm for computing Levenshtein and Damerau edit distances. Nordic Journal of Computing 10, 1-11.
12. th Australasian Workshop on Combinatorial Algorithms (AWOCA '04). 16-27.
13. th Combinatorial Pattern Matching (CPM '02). LNCS 2373. Berlin, Germany, Springer, New York. 203-224.
14. HYYRÖ, H. AND NAVARRO, G. 2005. Bit-parallel witnesses and their applications to approximate string matching. Algorithmica 41, 3, 203-231.
15. LEVENSHTEIN, V. 1966. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady 10, 8, 707-710. [Original in Russian in Doklady Akademii Nauk SSSR, 163(4):845-848, 1965].
16. th Annual Symposium on Combinatorial Pattern Matching (CPM '96). LNCS 1075. Springer-Verlag, New York. 75-86.
17. MYERS, G. 1999. A fast bit-vector algorithm for approximate string matching based on dynamic progamming. Journal of the ACM 46, 3, 395-415.
18. NAVARRO, G. 2001. A guided tour to approximate string matching. ACMComputing Surveys 33, 1, 31-88.
19. NAVARRO, G. AND BAEZA-YATES, R. 1999. Very fast and simple approximate string matching. Information Processing Letters 72, 65-70.
20. NAVARRO, G. AND BAEZA-YATES, R. 2001. Improving an algorithm for approximate string matching. Algorithmica 30, 4, 473-502.
21. NAVARRO, G. AND RAFFINOT, M. 2000. Fast and flexible string matching by combining bit-parallelism and suffix automata. ACM Journal of Experimental Algorithmics (JEA). 5, 4.
22. NAVARRO, G. AND RAFFINOT, M. 2002. Flexible Pattern Matching in Strings - Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, Cambridge, UK. ISBN 0-521-81307-7.
23. SELLERS, P. 1980. The theory and computation of evolutionary distances: pattern recognition. Journal of Algorithms 1, 359-373.
24. UKKONEN, E. 1985a. Algorithms for approximate string matching. Information and Control 64, 1-3, 100-118.
25. UKKONEN, E. 1985b. Finding approximate patterns in strings. Journal of Algorithms 6, 132-137.
26. WARREN, H. S. 2003. Hacker's Delight. Addison-Wesley, Boston, MA. ISBN 0-201-91465-4.
27. WU, S. AND MANBER, U. 1992. Fast text searching allowing errors. Communications of the ACM 35, 10, 83-91.