Complexity and algorithms for MUL-tree pruning
From MaRDI portal
Publication:2115868
DOI10.1007/978-3-030-79987-8_23OpenAlexW3174688402MaRDI QIDQ2115868
Riccardo Dondi, Nadia El-Mabrouk, Mathieu Gascon
Publication date: 22 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-79987-8_23
Related Items (1)
Uses Software
Cites Work
- 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
- Gene tree correction for reconciliation and species tree inference: complexity and 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
- Parameterized Algorithms
This page was built for publication: Complexity and algorithms for MUL-tree pruning