Back to Search
Start Over
Corrigendum to “Parameterized tractability of the maximum-duo preservation string mapping problem” [Theoret. Comput. Sci. 646 (2016) 16–25].
- Source :
-
Theoretical Computer Science . Nov2016, Vol. 653, p108-110. 3p. - Publication Year :
- 2016
-
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. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 653
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 118923407
- Full Text :
- https://doi.org/10.1016/j.tcs.2016.09.015