Phylogenetic supertrees. Combining information to reveal the tree of life
From MaRDI portal
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to biology (92-01) Genetics and epigenetics (92D10) Problems related to evolution (92D15)
Recommendations
Cited in
(40)- On the estimation of nested Archimedean copulas: a theoretical and an experimental comparison
- Counting consistent phylogenetic trees is \#P-complete
- Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model
- MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms
- Complexity and algorithms for MUL-tree pruning
- Site pattern probabilities under the multispecies coalescent and a relaxed molecular clock: theory and applications
- Reconstructing pedigrees: a combinatorial perspective
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
- Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study
- Closure operations in phylogenetics
- On the ancestral compatibility of two phylogenetic trees with nested taxa
- A cubic-vertex kernel for flip consensus tree
- Gaussian approximations for phylogenetic branch length statistics under stochastic models of biodiversity
- Maximum agreement and compatible supertrees
- Some axiomatic limitations for consensus and supertree functions on hierarchies
- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees
- Mathematical aspects of phylogenetic groves
- \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time
- Optimizing tree and character compatibility across several phylogenetic trees
- Bounding the maximum size of a minimal definitive set of quartets
- Optimizing phylogenetic supertrees using answer set programming
- Large-Scale Multiple Sequence Alignment and Phylogeny Estimation
- scientific article; zbMATH DE number 7564377 (Why is no real title available?)
- Consensus clusters in Robinson-Foulds reticulation networks
- Representations of partial leaf sets in phylogenetic tree space
- Fixed-Parameter Algorithms for Finding Agreement Supertrees
- Distinguished minimal topological lassos
- Comparing and Aggregating Partially Resolved Trees
- The asymmetric cluster affinity cost
- Majority-rule (+) consensus trees
- A fast quartet tree heuristic for hierarchical clustering
- Implementing logical connectives in constraint programming
- Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees
- Comparing and aggregating partially resolved trees
- Slim sets of binary trees
- Groves of phylogenetic trees
- Variational supertrees for Bayesian phylogenetics
- A survey of the monotonicity and non-contradiction of consensus methods and supertree methods
- Encoding phylogenetic trees in terms of weighted quartets
- Two novel closure rules for constructing phylogenetic super-networks
This page was built for publication: Phylogenetic supertrees. Combining information to reveal the tree of life
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1766084)
