Searching for "Maximum Compatible Tree." – sorted by Relevance.
-
Solving the Maximum Agreement SubTree and the Maximum Compatible Tree problems on many bounded
- and with the largest number of leaves. Its variant called Maximum Compatible Tree (MCT) is less stringent, as it allows
- Cited by 1 (0 self) – Add To MetaCart
-
Finding a Maximum Compatible Tree for a BoundedNumber of Trees with Bounded Degree is Solvable in
- Finding a Maximum Compatible Tree for a BoundedNumber of Trees with Bounded Degree is Solvable
- Add To MetaCart
-
Improved Parameterized Complexity of the
- Improved parameterized complexity of the Maximum Agreement Subtree and Maximum Compatible Tree
- Add To MetaCart
-
By LUAY NAKHLEH a,TANDY WARNOW b,DON RINGE c AND
- seeks a tree on which the maximum number of characters are compatible. Like MP, it is hard to solve
- Add To MetaCart
-
A comparison of phylogenetic reconstruction methods on an IE dataset
- , including maximum parsimony, maximum compatibility, UPGMA, neighbor joining, and the majority consensus tree
- Cited by 1 (0 self) – Add To MetaCart
-
Maximum Agreement and Compatible Supertrees
- maximum compatible tree (MCT) which is of interest when input trees are non-binary [20, 16], to obtain
- Cited by 7 (4 self) – Add To MetaCart
-
On the Approximation of Computing of
- input trees can have different sets of leaves [3]. The Maximum Compatible Tree problem (MCT) is a
- Add To MetaCart
-
On the approximation of computing evolutionary trees
- to the context of supertrees where input trees can have different sets of leaves [3]. The Maximum Compatible Tree
- Cited by 5 (2 self) – Add To MetaCart

