Pages that link to "Item:Q1293865"

The following pages link to Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology (Q1293865):

Displaying 24 items.

• \textsc{FlipCut} supertrees: towards matrix representation accuracy in polynomial time (Q378228) (← links)
• Constructing the simplest possible phylogenetic network from triplets (Q534764) (← links)
• New results on optimizing rooted triplets consistency (Q708349) (← links)
• Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
• Faster algorithms for computing the R* consensus tree (Q727985) (← links)
• Incomplete directed perfect phylogeny in linear time (Q832858) (← links)
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets (Q860812) (← links)
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets (Q1730227) (← links)
• New heuristics for rooted triplet consistency (Q1736566) (← links)
• The matroid structure of representative triple sets and triple-closure computation (Q1746594) (← links)
• Reconstructing gene trees from Fitch's xenology relation (Q1789081) (← links)
• Reconstructing minimal rooted trees. (Q1811070) (← links)
• Orthology relations, symbolic ultrametrics, and cographs (Q1937881) (← links)
• Best match graphs with binary trees (Q2062000) (← links)
• Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study (Q2312406) (← links)
• Best match graphs (Q2420450) (← links)
• The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets (Q2942263) (← links)
• Efficient and Dynamic Algorithms for Alternating Büchi Games and Maximal End-Component Decomposition (Q3189650) (← links)
• Finding 2-Edge and 2-Vertex Strongly Connected Components in Quadratic Time (Q3448829) (← 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)
• Inducibility in Binary Trees and Crossings in Random Tanglegrams (Q5348495) (← links)
• (Q5743484) (← links)
• Building a small and informative phylogenetic supertree (Q6077843) (← links)