Calculating distances for dissimilar strings: the shortest path formulation revisited
From MaRDI portal
Publication:856246
DOI10.1016/J.EJOR.2005.09.005zbMATH Open1111.90073OpenAlexW2022230881MaRDI QIDQ856246FDOQ856246
Konstantinos 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
Recommendations
- scientific article; zbMATH DE number 7203332
- Algorithms for closest and farthest string problems via rank distance
- scientific article; zbMATH DE number 2090203
- A new distance metric on strings computable in linear time
- On the closest string via rank distance
- Approximating reversal distance for strings with bounded number of duplicates
- Mathematical Foundations of Computer Science 2005
- Finding shortest and dissimilar paths
- Two shortest path metrics on well-formed parentheses strings
Cites Work
- Title not available (Why is that?)
- The String-to-String Correction Problem
- Title not available (Why is that?)
- A linear space algorithm for computing maximal common subsequences
- An \(O(ND)\) difference algorithm and its variations
- A Subquadratic Sequence Alignment Algorithm for Unrestricted Scoring Matrices
- Title not available (Why is that?)
- The longest common subsequence problem revisited
- Algorithms for the Longest Common Subsequence Problem
- An O(NP) sequence comparison algorithm
Cited In (4)
This page was built for publication: Calculating distances for dissimilar strings: the shortest path formulation revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856246)
