scientific article; zbMATH DE number 7561710
From MaRDI portal
Publication:5092429
DOI10.4230/LIPIcs.MFCS.2019.66MaRDI QIDQ5092429
Przemysław Uznański, Raphaël Clifford, Paweł Gawrychowski, Daniel P. Martin, Tomasz Kociumaka
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1905.01254
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- An improved algorithm for computing the edit distance of run-length coded strings
- An algorithm for matching run-length coded strings
- A fast and simple algorithm for computing the longest common subsequence of run-length encoded strings
- A faster algorithm computing string edit distances
- Matching for run-length encoded strings
- Edit distance of run-length encoded strings.
- A fully compressed algorithm for computing the edit distance of run-length encoded strings
- Edit distance for a run-length-encoded string and an uncompressed string
- Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
- Edit Distance Cannot Be Computed in Strongly Subquadratic Time (Unless SETH is False)
- Computing the Longest Common Subsequence of Two Run-Length Encoded Strings
This page was built for publication:
