Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CPM.2020.19
URN: urn:nbn:de:0030-drops-121443
URL: https://drops.dagstuhl.de/opus/volltexte/2020/12144/
Kipouridis, Evangelos ; Tsichlas, Kostas
Longest Common Subsequence on Weighted Sequences
| pdf-format: |
|
Abstract
We consider the general problem of the Longest Common Subsequence (LCS) on weighted sequences. Weighted sequences are an extension of classical strings, where in each position every letter of the alphabet may occur with some probability. Previous results presented a PTAS and noticed that no FPTAS is possible unless P=NP. In this paper we essentially close the gap between upper and lower bounds by improving both. First of all, we provide an EPTAS for bounded alphabets (which is the most natural case), and prove that there does not exist any EPTAS for unbounded alphabets unless FPT=W[1]. Furthermore, under the Exponential Time Hypothesis, we provide a lower bound which shows that no significantly better PTAS can exist for unbounded alphabets. As a side note, we prove that it is sufficient to work with only one threshold in the general variant of the problem.
BibTeX - Entry
@InProceedings{kipouridis_et_al:LIPIcs:2020:12144,
author = {Evangelos Kipouridis and Kostas Tsichlas},
title = {{Longest Common Subsequence on Weighted Sequences}},
booktitle = {31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020)},
pages = {19:1--19:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-149-8},
ISSN = {1868-8969},
year = {2020},
volume = {161},
editor = {Inge Li G{\o}rtz and Oren Weimann},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12144},
URN = {urn:nbn:de:0030-drops-121443},
doi = {10.4230/LIPIcs.CPM.2020.19},
annote = {Keywords: WLCS, LCS, weighted sequences, approximation algorithms, lower bound}
}
| Keywords: | WLCS, LCS, weighted sequences, approximation algorithms, lower bound | |
| Seminar: | 31st Annual Symposium on Combinatorial Pattern Matching (CPM 2020) | |
| Issue date: | 2020 | |
| Date of publication: | 09.06.2020 |
