Complexity Insights of the Minimum Duplication Problem

DOI10.1007/978-3-642-27660-6_13zbMath1298.68108OpenAlexW2181191890MaRDI QIDQ2891364

Riccardo Dondi, Romeo Rizzi, Guillaume Blin, Florian Sikora, Paola Bonizzoni

Publication date: 15 June 2012

Published in: SOFSEM 2012: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10281/59865

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Genetics and epigenetics (92D10) Randomized algorithms (68W20) Computational methods for problems pertaining to biology (92-08)

Related Items (2)

Complexity insights of the minimum duplication problem ⋮ Gene tree correction for reconciliation and species tree inference: complexity and algorithms

Cites Work

• Unnamed Item
• New results on optimizing rooted triplets consistency
• Some APX-completeness results for cubic graphs
• An Approximation Algorithm for Computing a Parsimonious First Speciation in the Gene Duplication Model
• From Gene Trees to Species Trees
• An upper bound for the chromatic number of a graph and its application to timetabling problems

This page was built for publication: Complexity Insights of the Minimum Duplication Problem