A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit <a rel="external noopener" href="https://arxiv.org/pdf/1512.03220v1.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Parameterized Tractability of the Maximum-Duo Preservation String Mapping Problem
[article]
<span title="2015-12-10">2015</span>
<i >
arXiv
</i>
<span class="release-stage" >pre-print</span>
In this paper we investigate the parameterized complexity of the Maximum-Duo Preservation String Mapping Problem, the complementary of the Minimum Common String Partition Problem. We show that this problem is fixed-parameter tractable when parameterized by the number k of conserved duos, by first giving a parameterized algorithm based on the color-coding technique and then presenting a reduction to a kernel of size O(k^6 ).
<span class="external-identifiers">
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1512.03220v1">arXiv:1512.03220v1</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/ddxcvyqchrerlnil5ms2icubvm">fatcat:ddxcvyqchrerlnil5ms2icubvm</a>
</span>
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20200929023622/https://arxiv.org/pdf/1512.03220v1.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/df/6f/df6f436073b6580dfdf2631ec8de24f87200be49.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener" href="https://arxiv.org/abs/1512.03220v1" title="arxiv.org access">
<button class="ui compact blue labeled icon button serp-button">
<i class="file alternate outline icon"></i>
arxiv.org
</button>
</a>