Metric indexes for approximate string matching in a dictionary

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

Volumn 3246, Issue , 2004, Pages 212-213

  Fredriksson, Kimmo ^a  

^a UNIVERSITY OF EASTERN FINLAND   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (4)

1. W. A. Burkhard and R. M. Keller. Some approaches to best-match file searching. Commun. ACM, 16(4):230-236, 1973.
2. E. Chávez, G. Navarro, R. Baeza-Yates, and J.L. Marroquin. Searching in metric spaces. ACM Computing Surveys, 33(3):273-321, September 2001.
3. H. Hyyrö, K. Fredriksson, and G. Navarro. Increased bit-parallelism for approximate string matching. In WEA'04, LNCS 3059, pages 285-298, 2004.
4. E. Vidal. An algorithm for finding nearest neighbors in (approximately) constant average time. Pattern Recognition Letters, 4:145-157, 1986.