Reconstructing minimal rooted trees.
From MaRDI portal
Recommendations
- New results on optimizing rooted triplets consistency
- New Results on Optimizing Rooted Triplets Consistency
- scientific article; zbMATH DE number 2089994
- Building a small and informative phylogenetic supertree
- The complexity of inferring a minimally resolved phylogenetic supertree
- scientific article; zbMATH DE number 6851886
- scientific article; zbMATH DE number 7564377
- New heuristics for rooted triplet consistency
Cites work
- An efficient algorithm for supertrees
- Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology
- Extension operations on sets of leaf-labelled trees
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
- Reconstruction of rooted trees from subtrees
- The complexity of reconstructing trees from qualitative characters and subtrees
Cited in
(11)- Best match graphs with binary trees
- Closure operations in phylogenetics
- Recovering a phylogenetic tree using pairwise closure operations
- Minimum triplet covers of binary phylogenetic \(X\)-trees
- Reduced representations of rooted trees.
- Complete characterization of incorrect orthology assignments in best match graphs
- An efficient algorithm for supertrees
- The complexity of inferring a minimally resolved phylogenetic supertree
- Computing quadratic entropy in evolutionary trees
- The matroid structure of representative triple sets and triple-closure computation
- Best match graphs
This page was built for publication: Reconstructing minimal rooted trees.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1811070)
