DocumentCode
1743054
Title
Speeding up the computation of the edit distance for cyclic strings
Author
Marzal, Andrés ; Barrachina, Sergio
Author_Institution
Dept. d´´Inf., Jaume I Univ., Castello, Spain
Volume
2
fYear
2000
fDate
2000
Firstpage
891
Abstract
A new algorithm to compute the edit distance between cyclic strings is presented. Experimental results with synthetic cyclic strings and a handwritten digits recognition task show that the new algorithm is faster than Maes´ (1990) and Gregor and Thomason´s (1993) algorithms
Keywords
computational complexity; handwritten character recognition; string matching; cyclic strings; edit distance computation; handwritten digits recognition task; Contracts; Costs; Dynamic programming; Handwriting recognition; Heuristic algorithms; Pattern recognition; Tree graphs;
fLanguage
English
Publisher
ieee
Conference_Titel
Pattern Recognition, 2000. Proceedings. 15th International Conference on
Conference_Location
Barcelona
ISSN
1051-4651
Print_ISBN
0-7695-0750-6
Type
conf
DOI
10.1109/ICPR.2000.906217
Filename
906217
Link To Document