Pages that link to "Item:Q3912082"
From MaRDI portal
The following pages link to Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions (Q3912082):
Displayed 29 items.
- Constructing the simplest possible phylogenetic network from triplets (Q534764) (← links)
- Building species trees from larger parts of phylogenomic databases (Q553332) (← links)
- Graph triangulations and the compatibility of unrooted phylogenetic trees (Q628277) (← links)
- Groves of phylogenetic trees (Q659789) (← links)
- New results on optimizing rooted triplets consistency (Q708349) (← links)
- Compatibility of unrooted phylogenetic trees is FPT (Q820142) (← links)
- Inferring a level-1 phylogenetic network from a dense set of rooted triplets (Q860812) (← links)
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
- Graph-theoretic method for merging security system specifications (Q881862) (← links)
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation (Q990618) (← links)
- Combining tree partitioning, precedence, and incomparability constraints (Q1020493) (← links)
- Tree enumeration modulo a consensus (Q1107457) (← links)
- Algebraic dependencies (Q1168760) (← links)
- The complexity of reconstructing trees from qualitative characters and subtrees (Q1203103) (← links)
- A supertree method for rooted trees (Q1582076) (← links)
- Reconstructing minimal rooted trees. (Q1811070) (← links)
- Counting consistent phylogenetic trees is \#P-complete (Q1883389) (← links)
- An efficient algorithm for supertrees (Q1901397) (← links)
- A robust model for finding optimal evolutionary tree (Q1902471) (← links)
- Reconstruction of rooted trees from subtrees (Q1923599) (← links)
- The difficulty of constructing a leaf-labelled tree including or avoiding given subtrees (Q1962070) (← links)
- Tree representations of non-symmetric group-valued proximities (Q1970526) (← links)
- Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938) (← links)
- Closure operations in phylogenetics (Q2382399) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- From Gene Trees to Species Trees through a Supertree Approach (Q3618625) (← links)
- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time (Q3637119) (← links)
- Constraint Satisfaction Problems with Infinite Templates (Q5504704) (← links)
- A Linear Time Approximation Scheme for Maximum Quartet Consistency on Sparse Sampled Inputs (Q5894223) (← links)