Calculating distances for dissimilar strings: the shortest path formulation revisited
type: Item
instance of: scholarly article
title: Calculating distances for dissimilar strings: the shortest path formulation revisited
zbMATH Open document ID: 1111.90073
published in: European Journal of Operational Research
publication date: 2006-12-07T00:00:00Z
Mathematics Subject Classification ID: 90B99
zbMATH DE Number: 5078496
zbMATH Keywords: computing science
zbMATH Keywords: data cleansing
zbMATH Keywords: shortest path problem
zbMATH Keywords: string matching
zbMATH Keywords: Levenshtein distance
author: Konstantinos Spiliopoulos
author: Stella Sofianopoulou
MaRDI profile type: Publication
full work available at URL: j.ejor.2005.09.005
OpenAlex ID: W2022230881
cites work: The longest common subsequence problem revisited
cites work: A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
cites work: A linear space algorithm for computing maximal common subsequences
cites work: Algorithms for the Longest Common Subsequence Problem
cites work: Q5528329
cites work: An \(O(ND)\) difference algorithm and its variations
cites work: Q4509227
cites work: Q4859180
cites work: The String-to-String Correction Problem
cites work: An O(NP) sequence comparison algorithm
DOI: 10.1016/J.EJOR.2005.09.005
Recommended article: Q5110893
Recommended article: Algorithms for closest and farthest string problems via rank distance
Recommended article: Q4808933
Recommended article: A new distance metric on strings computable in linear time
Recommended article: On the Closest String via Rank Distance
Recommended article: Approximating reversal distance for strings with bounded number of duplicates
Recommended article: Mathematical Foundations of Computer Science 2005
Recommended article: Finding shortest and dissimilar paths
Recommended article: Two shortest path metrics on well-formed parentheses strings
description: scientific article; zbMATH DE number 5078496