A dynamic edit distance table
From MaRDI portal
Publication:876720
DOI10.1016/S1570-8667(03)00082-0zbMATH Open1118.68757MaRDI QIDQ876720FDOQ876720
Publication date: 26 April 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
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
- The String-to-String Correction Problem
- Fast parallel and serial approximate string matching
- Incremental String Comparison
- Algorithms for approximate string matching
- An Improved Algorithm For Approximate String Matching
- Finding approximate patterns in strings
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- Fast string matching with k differences
- Approximate string matching with suffix automata
- Data structures and algorithms for approximate string matching
- Approximate periods of strings
Cited In (8)
- Title not available (Why is that?)
- \(k\)-approximate quasiperiodicity under Hamming and edit distance
- Semi-local longest common subsequences in subquadratic time
- On almost Monge all scores matrices
- Efficient all path score computations on grid graphs
- Dynamic edit distance table under a general weighted cost function
- Title not available (Why is that?)
- Dynamic RLE-Compressed Edit Distance Tables Under General Weighted Cost Functions
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)
