The following pages link to Rooted maximum agreement supertrees (Q818677):
Displaying 23 items.
- Kernel and fast algorithm for dense triplet inconsistency (Q391097) (← links)
- Improved algorithms for maximum agreement and compatible supertrees (Q627540) (← 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)
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves (Q1091713) (← links)
- A supertree method for rooted trees (Q1582076) (← 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)
- An efficient algorithm for supertrees (Q1901397) (← links)
- Indirect identification of horizontal gene transfer (Q2040274) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- Polynomial-time algorithms for the ordered maximum agreement subtree problem (Q2642315) (← links)
- Computing the maximum agreement of phylogenetic networks (Q2845521) (← links)
- (Q4532062) (← links)
- Fixed parameter polynomial time algorithms for maximum agreement and compatible supertrees (Q4910733) (← links)
- (Q5091725) (← links)
- Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q5252691) (← links)
- Combinatorial Pattern Matching (Q5315328) (← links)
- Combinatorial Pattern Matching (Q5315329) (← links)
- Algorithms and Computation (Q5712148) (← links)
- LATIN 2004: Theoretical Informatics (Q5901669) (← links)
- Building a small and informative phylogenetic supertree (Q6077843) (← links)
