Revisiting the parameterized complexity of maximum-duo preservation string mapping

DOI10.4230/LIPICS.CPM.2017.11MaRDI QIDQ5110875zbMATH OpenFDO

Authors Christian Komusiewicz, Mateus de Oliveira Oliveira, Meirav Zehavi

Publication date 25 May 2020

Full work available at URL https://doi.org/10.4230/LIPICS.CPM.2017.11

zbMATH Keywords

comparative genomicskernelizationparameterized complexity

Mathematics Subject Classification ID

Parameterized complexity, tractability and kernelization (68Q27) Randomized algorithms (68W20) Algorithms on strings (68W32) Analysis of algorithms (68W40) Genetics and epigenetics (92D10)

Recommendations

• Revisiting the parameterized complexity of maximum-duo preservation string mapping
• Parameterized tractability of the maximum-duo preservation string mapping problem
• A family of approximation algorithms for the maximum duo-preservation string mapping problem
• The Maximum Duo-Preservation String Mapping Problem with Bounded Alphabet *
• A 7/2-approximation algorithm for the maximum duo-preservation string mapping problem

Cited in

(4)

• Revisiting the parameterized complexity of maximum-duo preservation string mapping
• Parameterized tractability of the maximum-duo preservation string mapping problem
• Corrigendum to: ``Parameterized tractability of the maximum-duo preservation string mapping problem.
• Fast matching-based approximations for maximum duo-preservation string mapping and its weighted variant

This page was built for publication: Revisiting the parameterized complexity of maximum-duo preservation string mapping

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5110875)