Dynamic RLE-compressed edit distance tables under general weighted cost functions
From MaRDI portal
Publication:3177340
DOI10.1142/S0129054118410083zbMATH Open1397.68242OpenAlexW2811254326MaRDI QIDQ3177340FDOQ3177340
Authors: Heikki Hyyrö, Shunsuke Inenaga 
Publication date: 24 July 2018
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054118410083
Recommendations
Cites Work
- Matching for run-length encoded strings
- Approximate matching of run-length compressed strings
- Incremental String Comparison
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- FINDING ALL APPROXIMATE GAPPED PALINDROMES
- An improved algorithm for computing the edit distance of run-length coded strings
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
- Dynamic edit distance table under a general weighted cost function
- A dynamic edit distance table
- Edit distance of run-length encoded strings.
- Compacting a dynamic edit distance table by RLE compression
- Computing the longest common subsequence of two run-length encoded strings
- Sequence Alignment Algorithms for Run-Length-Encoded Strings
- String comparison by transposition networks
- Average-case optimal approximate circular string matching
- A fully compressed algorithm for computing the edit distance of run-length encoded strings
Cited In (4)
This page was built for publication: Dynamic RLE-compressed edit distance tables under general weighted cost functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177340)
