Pages that link to "Item:Q1766084"

The following pages link to Phylogenetic supertrees. Combining information to reveal the tree of life (Q1766084):

Displaying 38 items.

• Some axiomatic limitations for consensus and supertree functions on hierarchies (Q307637) (← links)
• Mathematical aspects of phylogenetic groves (Q360362) (← links)
• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time (Q378228) (← links)
• Optimizing tree and character compatibility across several phylogenetic trees (Q391984) (← links)
• Bounding the maximum size of a minimal definitive set of quartets (Q456077) (← links)
• Majority-rule (+) consensus trees (Q608873) (← links)
• A fast quartet tree heuristic for hierarchical clustering (Q622012) (← links)
• Implementing logical connectives in constraint programming (Q622127) (← links)
• Comparing and aggregating partially resolved trees (Q650896) (← links)
• Slim sets of binary trees (Q654890) (← links)
• Groves of phylogenetic trees (Q659789) (← links)
• Encoding phylogenetic trees in terms of weighted quartets (Q938146) (← links)
• Two novel closure rules for constructing phylogenetic super-networks (Q954295) (← links)
• On the estimation of nested Archimedean copulas: a theoretical and an experimental comparison (Q1643026) (← links)
• Counting consistent phylogenetic trees is \#P-complete (Q1883389) (← links)
• Reconstructing pedigrees: Some identifiability questions for a recombination-mutation model (Q1937885) (← links)
• MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms (Q2089669) (← links)
• Complexity and algorithms for MUL-tree pruning (Q2115868) (← links)
• Site pattern probabilities under the multispecies coalescent and a relaxed molecular clock: theory and applications (Q2137445) (← links)
• Reconstructing pedigrees: a combinatorial perspective (Q2202133) (← links)
• Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938) (← links)
• Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study (Q2312406) (← links)
• Closure operations in phylogenetics (Q2382399) (← links)
• Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
• On the ancestral compatibility of two phylogenetic trees with nested taxa (Q2433022) (← links)
• A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
• Gaussian approximations for phylogenetic branch length statistics under stochastic models of biodiversity (Q2455550) (← links)
• Maximum agreement and compatible supertrees (Q2466022) (← links)
• An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees (Q3503577) (← links)
• Optimizing phylogenetic supertrees using answer set programming (Q4593001) (← links)
• Large-Scale Multiple Sequence Alignment and Phylogeny Estimation (Q4992756) (← links)
• (Q5091736) (← links)
• Representations of Partial Leaf Sets in Phylogenetic Tree Space (Q5208889) (← links)
• Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q5252691) (← links)
• Distinguished Minimal Topological Lassos (Q5265017) (← links)
• Comparing and Aggregating Partially Resolved Trees (Q5458518) (← links)
• Advancing divide-and-conquer phylogeny estimation using Robinson-Foulds supertrees (Q6487649) (← links)
• Variational supertrees for Bayesian phylogenetics (Q6597995) (← links)