Pages that link to "Item:Q3912082"

The following pages link to Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions (Q3912082):

Displaying 50 items.

• Determining phylogenetic networks from inter-taxa distances (Q304036) (← links)
• Some axiomatic limitations for consensus and supertree functions on hierarchies (Q307637) (← links)
• Compatibility, incompatibility, tree-width, and forbidden phylogenetic minors (Q324834) (← links)
• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time (Q378228) (← links)
• Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
• Optimizing tree and character compatibility across several phylogenetic trees (Q391984) (← links)
• Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets (Q513300) (← links)
• 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)
• Fast compatibility testing for rooted phylogenetic trees (Q724246) (← 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)
• Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← 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)
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets (Q1730227) (← links)
• New heuristics for rooted triplet consistency (Q1736566) (← links)
• Phylogenetic flexibility via Hall-type inequalities and submodularity (Q1736949) (← links)
• On the weighted quartet consensus problem (Q1737590) (← links)
• The matroid structure of representative triple sets and triple-closure computation (Q1746594) (← links)
• On compatibility and incompatibility of collections of unrooted phylogenetic trees (Q1752481) (← links)
• Reconstructing gene trees from Fitch's xenology relation (Q1789081) (← 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)
• Orthology relations, symbolic ultrametrics, and cographs (Q1937881) (← 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)
• Indirect identification of horizontal gene transfer (Q2040274) (← links)
• Best match graphs with binary trees (Q2062000) (← links)
• MUL-tree pruning for consistency and optimal reconciliation -- complexity and algorithms (Q2089669) (← links)
• Complexity and algorithms for MUL-tree pruning (Q2115868) (← links)
• Classes of explicit phylogenetic networks and their biological and mathematical significance (Q2140011) (← links)
• Reconstructing phylogenetic trees from multipartite quartet systems (Q2149097) (← links)
• Caterpillars on three and four leaves are sufficient to binary normal networks (Q2204868) (← links)
• Trinets encode orchard phylogenetic networks (Q2232132) (← links)
• Trinets encode tree-child and level-2 phylogenetic networks (Q2249670) (← links)
• Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks (Q2266938) (← links)
• NCHB: a method for constructing rooted phylogenetic networks from rooted triplets based on height function and binarization (Q2295760) (← links)