Minimum Leaf Removal for Reconciliation: Complexity and Algorithms

DOI10.1007/978-3-642-31265-6_32zbMath1358.68114OpenAlexW97999600MaRDI QIDQ2904513

Nadia El-Mabrouk, Riccardo Dondi

Publication date: 14 August 2012

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31265-6_32

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

Gene tree correction for reconciliation and species tree inference: complexity and algorithms ⋮ Error Detection and Correction of Gene Trees

Uses Software

• Notung

This page was built for publication: Minimum Leaf Removal for Reconciliation: Complexity and Algorithms