Calculating distances for dissimilar strings: the shortest path formulation revisited

DOI10.1016/j.ejor.2005.09.005zbMath1111.90073OpenAlexW2022230881MaRDI QIDQ856246

Konstantinos V. Spiliopoulos, Stella Sofianopoulou

Publication date: 7 December 2006

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2005.09.005

zbMATH Keywords

string matchingshortest path problemcomputing scienceLevenshtein distancedata cleansing

Mathematics Subject Classification ID

Operations research and management science (90B99)

Related Items (1)

Research trends in combinatorial optimization

Cites Work

• An O(NP) sequence comparison algorithm
• The longest common subsequence problem revisited
• An \(O(ND)\) difference algorithm and its variations
• A linear space algorithm for computing maximal common subsequences
• Algorithms for the Longest Common Subsequence Problem
• The String-to-String Correction Problem
• A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Calculating distances for dissimilar strings: the shortest path formulation revisited