MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms

DOI10.1016/J.TCS.2022.09.027MaRDI QIDQ2089669zbMATH OpenOpenAlexFDO

Authors Mathieu Gascon, Riccardo Dondi, Nadia El-Mabrouk

Publication date 24 October 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.09.027

zbMATH Keywords

duplicationgene treemulti-labeled treephylogenyreconciliation

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Complexity and algorithms for MUL-tree pruning
• Algorithms for building consensus MUL-trees
• Fixed-parameter tractability and data reduction for multicut in trees
• Tree-deletion pruning in label-correcting algorithms for the multiobjective shortest path problem
• Computing a consensus of multilabeled trees
• Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees
• Algorithms and Computation
• Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees
• Publication:4493449

Cites work

• A supertree method for rooted trees
• Analytical approach to parallel repetition
• Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret
• Complexity and algorithms for MUL-tree pruning
• Computing a consensus of multilabeled trees
• DLS-trees: a model of evolutionary scenarios
• 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 3639144 (Why is no real title available?)
• 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
• The design of approximation algorithms

Cited in

(1)

• Compatible split systems on a multiset

Describes a project that uses

Uses Software

• PADRE
• PhySIC

This page was built for publication: MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms

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