Increased bit-parallelism for approximate string matching

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

Volumn 3059, Issue , 2004, Pages 285-298

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

^a JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^b TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

^c UNIVERSITY OF EASTERN FINLAND   (Finland)

^d UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

APPROXIMATE STRING MATCHING; BIT PARALLELISM; MULTIPLE PATTERNS; SEARCH PARAMETERS; SEARCH PATTERNS; SINGLE COMPUTER; TIME ALGORITHMS; TIME BOUND;

ALGORITHMS;

EID: 35048903188     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24838-5_21     Document Type: Article

References (14)

1. R. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127-158, 1999.
2. K. Fredriksson. Row-wise tiling for the Myers' bit-parallel dynamic programming algorithm. In Proc. 10th International Symposium on String Processing and Information Retrieval (SPIRE'03), LNCS 2857, pages 66-79, 2003.
3. H. Hyyröl. Explaining and extending the bit-parallel approximate string matching algorithm of Myers. Technical Report A-2001-10, Department of Computer and Information Sciences, University of Tampere, Tampere, Finland, 2001.
4. H. Hyyr̈ and G. Navarro. Faster bit-parallel approximate string matching. In Proc. 13th Combinatorial Pattern Matching (CPM'2002), LNCS 2373, pages 203-224, 2002.
5. V. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Soviet Physics Doklady, 10(8):707-710, 1966.
6. Original in Russian in Doklady Akademii Nauk SSSR, 163(4):845-848, 1965.
7. G. Myers. A fast bit-vector algorithm for approximate string matching based on dynamic progamming. Journal of the ACM, 46(3):395-415, 1999.
8. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
9. G. Navarro and M. Raffinot. Flexible Pattern Matching in Strings - Practical on-line search algorithms for texts and biological sequences. Cambridge University Press, 2002. ISBN 0-521-81307-7.
10. P. Sellers. The theory and computation of evolutionary distances: pattern recognition. Journal of Algorithms, 1:359-373, 1980.
11. E. Ukkonen. Algorithms for approximate string matching. Information and Control, 64(1-3):100-118, 1985.
12. Esko Ukkonen. Finding approximate patterns in strings. Journal of Algorithms, 6:132-137, 1985.
13. H. S. Warren Jr. Hacker's Delight. Addison Wesley, 2003. ISBN 0-201-91465-4.
14. S. Wu and U. Manber. Fast text searching allowing errors. Communications of the ACM, 35(10):83-91, 1992.