Corrigendum to: ``Parameterized tractability of the maximum-duo preservation string mapping problem.

DOI10.1016/J.TCS.2016.09.015zbMath1353.68108OpenAlexW2530519209WikidataQ62044752 ScholiaQ62044752MaRDI QIDQ329729

Stefano Beretta, Mauro Castelli, Riccardo Dondi

Publication date: 21 October 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.09.015

zbMATH Keywords

computational biologyparameterized algorithmscommon string partition

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (2)

Revisiting the parameterized complexity of maximum-duo preservation string mapping ⋮ A \((1.4+\epsilon)\)-approximation algorithm for the 2-\textsc{Max-Duo} problem

Cites Work

• Parameterized tractability of the maximum-duo preservation string mapping problem

This page was built for publication: Corrigendum to: ``Parameterized tractability of the maximum-duo preservation string mapping problem.