Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.MFCS.2019.66
URN: urn:nbn:de:0030-drops-110109
URL: https://drops.dagstuhl.de/opus/volltexte/2019/11010/
Clifford, Raphaël ; Gawrychowski, Pawel ; Kociumaka, Tomasz ; Martin, Daniel P. ; Uznanski, Przemyslaw
RLE Edit Distance in Near Optimal Time
| pdf-format: |
|
Abstract
We show that the edit distance between two run-length encoded strings of compressed lengths m and n respectively, can be computed in O(mn log(mn)) time. This improves the previous record by a factor of O(n/log(mn)). The running time of our algorithm is within subpolynomial factors of being optimal, subject to the standard SETH-hardness assumption. This effectively closes a line of algorithmic research first started in 1993.
BibTeX - Entry
@InProceedings{clifford_et_al:LIPIcs:2019:11010,
author = {Rapha{\"e}l Clifford and Pawel Gawrychowski and Tomasz Kociumaka and Daniel P. Martin and Przemyslaw Uznanski},
title = {{RLE Edit Distance in Near Optimal Time}},
booktitle = {44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019)},
pages = {66:1--66:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-117-7},
ISSN = {1868-8969},
year = {2019},
volume = {138},
editor = {Peter Rossmanith and Pinar Heggernes and Joost-Pieter Katoen},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/11010},
URN = {urn:nbn:de:0030-drops-110109},
doi = {10.4230/LIPIcs.MFCS.2019.66},
annote = {Keywords: String algorithms, Compression, Pattern matching, Run-length encoding}
}
| Keywords: | String algorithms, Compression, Pattern matching, Run-length encoding | |
| Seminar: | 44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019) | |
| Issue date: | 2019 | |
| Date of publication: | 20.08.2019 |
