Pages that link to "Item:Q4376196"
From MaRDI portal
The following pages link to Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms (Q4376196):
Displaying 23 items.
- Tree edit distance and maximum agreement subtree (Q458389) (← links)
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees (Q476897) (← links)
- Improved algorithms for maximum agreement and compatible supertrees (Q627540) (← links)
- A constructive algorithm for realizing a distance matrix (Q858334) (← links)
- Finding maximal leaf-agreement isomorphic descendent subtrees from phylogenetic trees with different species (Q868961) (← links)
- Kernelization and parameterized algorithms for covering a tree by a set of stars or paths (Q897955) (← 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)
- The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics (Q1713404) (← links)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- On the extremal maximum agreement subtree problem (Q2197478) (← links)
- Fixed-parameter tractability for minimum tree cut/paste distance and minimum common integer partition (Q2285134) (← links)
- Generalized LCS (Q2378524) (← links)
- Comparison of alignment free string distances for complete genome phylogeny (Q2442771) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
- APPROXIMATING THE MAXIMUM ISOMORPHIC AGREEMENT SUBTREE IS HARD (Q4528764) (← links)
- On the Maximum Agreement Subtree Conjecture for Balanced Trees (Q5028359) (← links)
- Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract) (Q5150927) (← links)
- Algorithms and Computation (Q5191662) (← links)
- FINDING SMALLEST SUPERTREES UNDER MINOR CONTAINMENT (Q5249050) (← links)
- On the complexity of comparing evolutionary trees (Q5961623) (← links)
