Parameterized Tractability of the Maximum-Duo Preservation String Mapping Problem [article]

Stefano Beretta, Mauro Castelli, Riccardo Dondi
<span title="2015-12-10">2015</span> <i > arXiv </i> &nbsp; <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="">arXiv:1512.03220v1</a> <a target="_blank" rel="external noopener" href="">fatcat:ddxcvyqchrerlnil5ms2icubvm</a> </span>
<a target="_blank" rel="noopener" href="" 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="" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener" href="" title=" access"> <button class="ui compact blue labeled icon button serp-button"> <i class="file alternate outline icon"></i> </button> </a>