The following pages link to On the agreement of many trees (Q1352115):
Displaying 19 items.
- Tree edit distance and maximum agreement subtree (Q458389) (← links)
- Improved algorithms for maximum agreement and compatible supertrees (Q627540) (← links)
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation (Q990618) (← links)
- On the approximability of the maximum agreement subtree and maximum compatible tree problems (Q1028128) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- On the agreement of many trees (Q1352115) (← links)
- The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics (Q1713404) (← links)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- Comparing and distinguishing the structure of biological branching (Q2351339) (← links)
- From constrained to unconstrained maximum agreement subtree in linear time (Q2479535) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Polynomial-time algorithms for the ordered maximum agreement subtree problem (Q2642315) (← links)
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
- Computing the unrooted maximum agreement subtree in sub-quadratic time (Q5054809) (← links)
- On the strength of some trees (Q5154619) (← links)
- FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT (Q5249050) (← links)
- Combinatorial Pattern Matching (Q5315329) (← links)
- The asymmetric median tree. --- A new model for building consensus trees (Q5961632) (← links)
