Revisiting the parameterized complexity of maximum-duo preservation string mapping

DOI10.1016/j.tcs.2020.09.034zbMath1464.68445MaRDI QIDQ2210511

Meirav Zehavi, Mateus de Oliveira Oliveira, Christian Komusiewicz

Publication date: 6 November 2020

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

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/7343/

zbMATH Keywords

parameterized algorithms; kernelization; maximum-duo preservation string mapping

Mathematics Subject Classification ID

68W40: Analysis of algorithms

92D10: Genetics and epigenetics

68W20: Randomized algorithms

68W32: Algorithms on strings

68Q27: Parameterized complexity, tractability and kernelization