Dynamic edit distance table under a general weighted cost function
From MaRDI portal
Publication:491146
DOI10.1016/j.jda.2015.05.007zbMath1336.68316OpenAlexW433658864MaRDI QIDQ491146
Heikki Hyyrö, Kazuyuki Narisawa, Shunsuke Inenaga
Publication date: 24 August 2015
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2015.05.007
Related Items
Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions, Dynamic and internal longest common substring, Unnamed Item, \(k\)-approximate quasiperiodicity under Hamming and edit distance
Cites Work
- A dynamic edit distance table
- Semi-local string comparison: algorithmic techniques and applications
- A faster algorithm computing string edit distances
- An almost quadratic time algorithm for sparse spliced alignment
- Dynamic Edit Distance Table under a General Weighted Cost Function
- A linear space algorithm for computing maximal common subsequences
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- Incremental String Comparison
- The String-to-String Correction Problem
- Longest Common Subsequences in Permutations and Maximum Cliques in Circle Graphs
- Algorithms on Strings