New bit-parallel indel-distance algorithm

Lecture Notes in Computer Science

Volumn 3503, Issue , 2005, Pages 380-390

  Hyyrö, Heikki ^a   Pinzon, Yoan ^b   Shinohara, Ayumi ^a,c  

^a JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^b KING'S COLLEGE LONDON   (United Kingdom)

^c KYUSHU UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; PARALLEL PROCESSING SYSTEMS; PATTERN RECOGNITION;

BIT-OPERATIONS; PATTERN STRINGS; STRING MATCHING; TEXT STRING;

PARALLEL ALGORITHMS;

EID: 24944577387     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11427186_33     Document Type: Conference Paper

References (10)

1. R. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127-158, 1999.
2. H. Hyyrö, K. Fredriksson and G. Navarro. Increased Bit-Parallelism for Approximate String Matching in Proc. 3rd Workshop on Efficient and ExperimentalAlgorithms (WEA 2004), LNCS 3059, 285-298, 2004.
3. H. Hyyrö, Y. Pinzon and A. Shinohara. Fast Bit-Vector Algorithms for Approximate String Matching under Indel Distance in Proc. 31st Annual Conference on Current Trends in Theory and Practice of Informatics (SOFSEM 2005), LNCS 3381, 380-384, 2005.
4. 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.
5. V. I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones (original in Russian). Russian Problemy Peredachi Informatsii 1, 12-25, 1965.
6. G. Myers. A fast bit-vector algorithm for approximate string matching based on dynamic progamming. Journal of the ACM, 46(3):395-415, 1999.
7. G. Navarro. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88, 2001.
8. Esko Ukkonen. Finding approximate patterns in strings. Journal of Algorithms, 6:132-137, 1985.
9. A. Wright. Approximate string matching using within-word parallelism. Software Practice and Experience, 24(4):337-362, April 1994.
10. S. Wu and U. Manber. Fast text searching allowing errors. Comm. of the ACM, 35(10):83-91, October 1992.