Classes of cost functions for string edit distance

DOI10.1007/BF02526038zbMath0868.68062OpenAlexW2046104015MaRDI QIDQ1355732

S. V. Rice, T. A. Nartker, Horst Bunke

Publication date: 28 May 1997

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02526038

zbMATH Keywords

edit distancelongest common subsequenceminimum cost

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items

Unnamed Item

Cites Work

• Unnamed Item
• An \(O(ND)\) difference algorithm and its variations
• Parametric optimization of sequence alignment
• An Overview of Sequence Comparison: Time Warps, String Edits, and Macromolecules
• Algorithms for approximate string matching
• The String-to-String Correction Problem