MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms
From MaRDI portal
Publication:2089669
DOI10.1016/j.tcs.2022.09.027OpenAlexW4297317939MaRDI QIDQ2089669
Nadia El-Mabrouk, Mathieu Gascon, Riccardo Dondi
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
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Folding and unfolding phylogenetic trees and networks
- Fundamentals of parameterized complexity
- Non deterministic polynomial optimization problems and their approximations
- A supertree method for rooted trees
- Phylogenetic supertrees. Combining information to reveal the tree of life
- Complexity and algorithms for MUL-tree pruning
- Bioinformatics and phylogenetics. Seminal contributions of Bernard Moret
- Gene tree correction for reconciliation and species tree inference: complexity and algorithms
- DLS-trees: a model of evolutionary scenarios
- The Design of Approximation Algorithms
- From Gene Trees to Species Trees through a Supertree Approach
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Reducibility among Combinatorial Problems
- Computing a consensus of multilabeled trees
- Analytical approach to parallel repetition
- Parameterized Algorithms
This page was built for publication: MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms
