Please use this identifier to cite or link to this item:
Title: Calculating distances for dissimilar strings: The shortest path formulation revisited
Keywords: Algorithms
Data mining
Data reduction
Data structures
Identification (control systems)
Problem solving, Computing science
Data cleansing
Levenshtein distance
Shortest path problems
String matching, Operations research
Issue Date: 2007
Publisher: Elsevier
Citation: European Journal of Operational Research vol. 177 no. 1 pp. 525-539
ISSN: 0377-2217
Appears in Collections:Δημοσιεύσεις σε Περιοδικά

Files in This Item:
There are no files associated with this item.

Items in CRIS are protected by copyright, with all rights reserved, unless otherwise indicated.