Complexity and algorithms for MUL-tree pruning

DOI10.1007/978-3-030-79987-8_23MaRDI QIDQ2115868zbMATH OpenOpenAlexFDO

Authors Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk

Publication date 22 March 2022

Full work available at URL https://doi.org/10.1007/978-3-030-79987-8_23

zbMATH Keywords

duplicationgene treemultilabeled treephylogenyreconciliation

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

Cites work

• A supertree method for rooted trees
• Computing a consensus of multilabeled trees
• Folding and unfolding phylogenetic trees and networks
• From Gene Trees to Species Trees through a Supertree Approach
• Fundamentals of parameterized complexity
• Gene tree correction for reconciliation and species tree inference: complexity and algorithms
• scientific article; zbMATH DE number 1974599 (Why is no real title available?)
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• Non deterministic polynomial optimization problems and their approximations
• Parameterized algorithms
• Phylogenetic supertrees. Combining information to reveal the tree of life
• Reducibility among combinatorial problems

Cited in

(6)

• Pruning by isomorphism in branch-and-cut
• On the computational complexity of the rooted subtree prune and regraft distance
• MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms
• Pruning of CRT-sub-trees
• scientific article; zbMATH DE number 1757963 (Why is no real title available?)
• MUL-tree pruning for consistency and compatibility

Describes a project that uses

Uses Software

• PADRE

This page was built for publication: Complexity and algorithms for MUL-tree pruning

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