Fast bit-vector algorithms for approximate string matching under indel distance

Lecture Notes in Computer Science

Volumn 3381, Issue , 2005, Pages 380-384

  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

ALGORITHMS; COMPUTER SIMULATION; DYNAMIC PROGRAMMING; QUERY LANGUAGES;

BIT-PARALLEL DYNAMIC PROGRAMMING ALGORITHM; DYNAMIC PROGRAMMING ALGORITHM; FAST BIT-VECTOR ALGORITHM; STRING MATCHING;

VECTORS;

EID: 24144477474     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30577-4_44     Document Type: Conference Paper

References (4)

1. R. Baeza-Yates and G. Navarro. Faster approximate string matching. Algorithmica, 23(2):127-158, 1999.
2. H. Hyyrö. Explaining and extending the bit-parallel approximate string matching algorithm of Myers. Technical Report A-2001-10, University of Tampere, 2001.
3. G. Myers. A fast bit-vector algorithm for approximate string matching based on dynamic progamming. Journal of the ACM, 46(3):395-415, 1999.
4. S. Wu and U. Manber. Fast text searching allowing errors. Comm. of the ACM, 35(10):83-91, October 1992.