Back to Search
Start Over
Parameterized tractability of the maximum-duo preservation string mapping problem.
- Source :
-
Theoretical Computer Science . Sep2016, Vol. 646, p16-25. 10p. - Publication Year :
- 2016
-
Abstract
- 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 ) . [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 03043975
- Volume :
- 646
- Database :
- Academic Search Index
- Journal :
- Theoretical Computer Science
- Publication Type :
- Academic Journal
- Accession number :
- 117798744
- Full Text :
- https://doi.org/10.1016/j.tcs.2016.07.011