TY - JOUR
T1 - 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))
AU - Beretta, Stefano
AU - Castelli, Mauro
AU - Dondi, Riccardo
PY - 2016/11/15
Y1 - 2016/11/15
N2 - 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.
AB - 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.
KW - Common string partition
KW - Computational biology
KW - Parameterized algorithms
UR - http://www.scopus.com/inward/record.url?scp=84994544508&partnerID=8YFLogxK
U2 - 10.1016/j.tcs.2016.09.015
DO - 10.1016/j.tcs.2016.09.015
M3 - Comment/debate
AN - SCOPUS:84994544508
SN - 0304-3975
VL - 653
SP - 108
EP - 110
JO - Theoretical Computer Science
JF - Theoretical Computer Science
ER -