Efficient alignment and correspondence using edit distance

DOI10.1007/3-540-44522-6_26MaRDI QIDQ4536497zbMATH OpenFDO

Authors Paolo Bergamini, Andrew D. J. Cross, Edwin R. Hancock, Stefano Levialdi, Richard Myers, L. Cinque, Richard Myers

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44522-6_26

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 7375961
• Edit distance and its computation
• Approximating the geometric edit distance
• Approximating the geometric edit distance
• On the computation of edit distance functions
• Shape matching using edit-distance: An implementation
• Approximating edit distance in near-linear time

Cited in

(3)

• Alignment and correspondence using singular value decomposition
• ALIGNMENT-TO-ALIGNMENT EDITING WITH “MOVE GAP” OPERATIONS
• scientific article; zbMATH DE number 7375961 (Why is no real title available?)

This page was built for publication: Efficient alignment and correspondence using edit distance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4536497)