An improvement and an extension on the hybrid index for approximate string matching

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

Volumn 3246, Issue , 2004, Pages 208-209

  Hyyrö, Heikki ^a,b  

^a JAPAN SCIENCE AND TECHNOLOGY AGENCY   (Japan)

^b TAMPERE UNIVERSITY OF TECHNOLOGY   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ADJACENT CHARACTERS; APPROXIMATE STRING MATCHING; LEVENSHTEIN EDIT DISTANCE;

ARTIFICIAL INTELLIGENCE;

COMPUTERS;

EID: 84871074576     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30213-1_28     Document Type: Conference Paper

References (2)

1. H. Hyyrö. Practical Methods for Approximate String Matching. PhD thesis, Department of Computer Sciences, University of Tampere, Finland, December 2003.
2. G. Navarro and R. Baeza-Yates. A hybrid indexing method for approximate string matching. Journal of Discrete Algorithms (JDA), 1(1):205-239, 2000.