Minimum leaf removal for reconciliation: complexity and algorithms

DOI10.1007/978-3-642-31265-6_32MaRDI QIDQ2904513zbMATH OpenOpenAlexFDO

Authors Riccardo Dondi, Nadia El-Mabrouk

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) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problems related to evolution (92D15)

Recommendations

• Gene Tree Correction by Leaf Removal and Modification: Tractability and Approximability
• Gene tree correction for reconciliation and species tree inference: complexity and algorithms
• Correcting gene tree by removal and modification: tractability and approximability
• Reconciling a gene tree to a species tree under the duplication cost model
• scientific article; zbMATH DE number 2011850

Cited in

(4)

• Gene tree correction for reconciliation and species tree inference: complexity and algorithms
• Correcting gene tree by removal and modification: tractability and approximability
• Error detection and correction of gene trees
• Constructing a consensus phylogeny from a leaf-removal distance (extended abstract)

Describes a project that uses

Uses Software

• Notung

This page was built for publication: Minimum leaf removal for reconciliation: complexity and algorithms

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