A dynamic edit distance table
From MaRDI portal
Publication:876720
Recommendations
- scientific article; zbMATH DE number 1615270
- Dynamic edit distance table under a general weighted cost function
- Dynamic edit distance table under a general weighted cost function
- Edit distance and its computation
- Compacting a dynamic edit distance table by RLE compression
- Dynamic RLE-compressed edit distance tables under general weighted cost functions
- On the computation of edit distance functions
- Approximating edit distance in near-linear time
- Approximating edit distance in near-linear time
Cites work
- Algorithms for approximate string matching
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- An Improved Algorithm For Approximate String Matching
- Approximate periods of strings
- Approximate string matching with suffix automata
- Data structures and algorithms for approximate string matching
- Fast parallel and serial approximate string matching
- Fast string matching with k differences
- Finding approximate patterns in strings
- Incremental String Comparison
- The String-to-String Correction Problem
Cited in
(9)- \(k\)-approximate quasiperiodicity under Hamming and edit distance
- Semi-local longest common subsequences in subquadratic time
- On almost Monge all scores matrices
- Computing longest common square subsequences
- Efficient all path score computations on grid graphs
- Compacting a dynamic edit distance table by RLE compression
- Dynamic RLE-compressed edit distance tables under general weighted cost functions
- Dynamic edit distance table under a general weighted cost function
- scientific article; zbMATH DE number 1615270 (Why is no real title available?)
This page was built for publication: A dynamic edit distance table
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q876720)
