Pages that link to "Item:Q1768596"

The following pages link to Constructing the maximum consensus tree from rooted Triples (Q1768596):

Displaying 12 items.

• Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
• New results on optimizing rooted triplets consistency (Q708349) (← links)
• Inferring a level-1 phylogenetic network from a dense set of rooted triplets (Q860812) (← links)
• Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← links)
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets (Q1730227) (← links)
• New heuristics for rooted triplet consistency (Q1736566) (← 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)
• Encoding and constructing 1-nested phylogenetic networks with trinets (Q2375949) (← links)
• The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets (Q2942263) (← links)
• (Q5091725) (← links)
• Building a small and informative phylogenetic supertree (Q6077843) (← links)