Phylogenetic supertrees. Combining information to reveal the tree of life
From MaRDI portal
Publication:1766084
zbMath1060.68083MaRDI QIDQ1766084
No author found.
Publication date: 25 February 2005
Published in: Computational Biology (Search for Journal in Brave)
Problems related to evolution (92D15) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Graph theory (including graph drawing) in computer science (68R10) Genetics and epigenetics (92D10) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to biology (92-01)
Related Items (37)
Counting consistent phylogenetic trees is \#P-complete ⋮ Site pattern probabilities under the multispecies coalescent and a relaxed molecular clock: theory and applications ⋮ Some axiomatic limitations for consensus and supertree functions on hierarchies ⋮ On the estimation of nested Archimedean copulas: a theoretical and an experimental comparison ⋮ Closure operations in phylogenetics ⋮ Mathematical aspects of phylogenetic groves ⋮ \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time ⋮ Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees ⋮ Majority-rule (+) consensus trees ⋮ Optimizing tree and character compatibility across several phylogenetic trees ⋮ Optimizing phylogenetic supertrees using answer set programming ⋮ The asymmetric cluster affinity cost ⋮ An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees ⋮ A fast quartet tree heuristic for hierarchical clustering ⋮ Implementing logical connectives in constraint programming ⋮ Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model ⋮ Reconstructing pedigrees: a combinatorial perspective ⋮ On the ancestral compatibility of two phylogenetic trees with nested taxa ⋮ A cubic-vertex kernel for flip consensus tree ⋮ Bounding the maximum size of a minimal definitive set of quartets ⋮ Comparing and aggregating partially resolved trees ⋮ Slim sets of binary trees ⋮ Groves of phylogenetic trees ⋮ Gaussian approximations for phylogenetic branch length statistics under stochastic models of biodiversity ⋮ Encoding phylogenetic trees in terms of weighted quartets ⋮ Maximum agreement and compatible supertrees ⋮ Two novel closure rules for constructing phylogenetic super-networks ⋮ Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks ⋮ Fixed-Parameter Algorithms for Finding Agreement Supertrees ⋮ Unnamed Item ⋮ Comparing and Aggregating Partially Resolved Trees ⋮ Representations of Partial Leaf Sets in Phylogenetic Tree Space ⋮ Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study ⋮ Large-Scale Multiple Sequence Alignment and Phylogeny Estimation ⋮ MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms ⋮ Distinguished Minimal Topological Lassos ⋮ Complexity and algorithms for MUL-tree pruning
This page was built for publication: Phylogenetic supertrees. Combining information to reveal the tree of life
