Artykuł w czasopiśmie
Brak miniatury
Licencja
CC-BY - Uznanie autorstwaMinimum Common String Partition: Exact Algorithms
| dc.abstract.en | In the minimum common string partition problem (MCSP), one gets two strings and is asked to find the minimum number of cuts in the first string such that the second string can be obtained by rearranging the resulting pieces. It is a difficult algorithmic problem having applications in computational biology, text processing, and data compression. MCSP has been studied extensively from various algorithmic angles: there are many papers studying approximation, heuristic, and parameterized algorithms. At the same time, almost nothing is known about its exact complexity. In this paper, we present new results in this direction. We improve the known 2ⁿ upper bound (where n is the length of input strings) to ϕⁿ where ϕ ≈ 1.618... is the golden ratio. The algorithm uses Fibonacci numbers to encode subsets as monomials of a certain implicit polynomial and extracts one of its coefficients using the fast Fourier transform. Then, we show that the case of constant size alphabet can be solved in subexponential time 2^{O(nlog log n/log n)} by a hybrid strategy: enumerate all long pieces and use dynamic programming over histograms of short pieces. Finally, we prove almost matching lower bounds assuming the Exponential Time Hypothesis. |
| dc.affiliation | Uniwersytet Warszawski |
| dc.conference.country | Portugalia |
| dc.conference.datefinish | 2021-09-08 |
| dc.conference.datestart | 2021-09-06 |
| dc.conference.place | Lizbona |
| dc.conference.series | European Symposium on Algorithms |
| dc.conference.series | European Symposium on Algorithms |
| dc.conference.seriesshortcut | ESA |
| dc.conference.weblink | http://algo2021.tecnico.ulisboa.pt/ESA2021/ |
| dc.contributor.author | Mihajlin, Ivan |
| dc.contributor.author | Kulikov, Alexander |
| dc.contributor.author | Nikolaev, Maksim |
| dc.contributor.author | Cygan, Marek |
| dc.contributor.author | Reznikov, Grigory |
| dc.date.accessioned | 2024-01-25T12:40:22Z |
| dc.date.available | 2024-01-25T12:40:22Z |
| dc.date.copyright | 2021-08-31 |
| dc.date.issued | 2021 |
| dc.description.accesstime | AT_PUBLICATION |
| dc.description.finance | Publikacja bezkosztowa |
| dc.description.version | FINAL_PUBLISHED |
| dc.identifier.doi | 10.4230/LIPICS.ESA.2021.35 |
| dc.identifier.uri | https://repozytorium.uw.edu.pl//handle/item/112639 |
| dc.identifier.weblink | https://drops.dagstuhl.de/opus/volltexte/2021/14616/ |
| dc.language | eng |
| dc.pbn.affiliation | computer and information sciences |
| dc.relation.pages | 35:1-35:16 |
| dc.rights | CC-BY |
| dc.sciencecloud | nosend |
| dc.subject.en | similarity measure |
| dc.subject.en | string distance |
| dc.subject.en | exact algorithms |
| dc.subject.en | upper bounds |
| dc.subject.en | lower bounds |
| dc.title | Minimum Common String Partition: Exact Algorithms |
| dc.type | JournalArticle |
| dspace.entity.type | Publication |