Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” (Theoretical Computer Science (2016) 646 (16–25) (S0304397516303255) (10.1016/j.tcs.2016.07.011))

Stefano Beretta, Mauro Castelli, Riccardo Dondi

Research output: Contribution to journalComment/debate

2 Citations (Scopus)

Abstract

This is a corrigendum for our paper [1], as we have found that the first FPT algorithm for the Maximum-Duo Preservation String Mapping Problem we presented is incorrect. However, we show that, by slightly modifying the color-coding technique on which the algorithm is based, we can fix the error, thus giving a correct FPT algorithm for Maximum-Duo Preservation String Mapping Problem.

Original languageEnglish
Pages (from-to)108-110
Number of pages3
JournalTheoretical Computer Science
Volume653
DOIs
Publication statusPublished - 15 Nov 2016

Keywords

  • Common string partition
  • Computational biology
  • Parameterized algorithms

Fingerprint Dive into the research topics of 'Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” (Theoretical Computer Science (2016) 646 (16–25) (S0304397516303255) (10.1016/j.tcs.2016.07.011))'. Together they form a unique fingerprint.

  • Cite this