Pages that link to "Item:Q1923599"

The following pages link to Reconstruction of rooted trees from subtrees (Q1923599):

Displaying 14 items.

• New results on optimizing rooted triplets consistency (Q708349) (← links)
• Combining tree partitioning, precedence, and incomparability constraints (Q1020493) (← links)
• A supertree method for rooted trees (Q1582076) (← links)
• Nonparametric estimation of the tree structure of a nested Archimedean copula (Q1623404) (← links)
• On the estimation of nested Archimedean copulas: a theoretical and an experimental comparison (Q1643026) (← links)
• The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets (Q1730227) (← links)
• Reconstructing minimal rooted trees. (Q1811070) (← links)
• Counting consistent phylogenetic trees is \#P-complete (Q1883389) (← 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)
• Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
• An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees (Q3503577) (← links)
• Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q5252691) (← links)
• Realization problems on reachability sequences (Q5925515) (← links)