Pages that link to "Item:Q2706115"
From MaRDI portal
The following pages link to An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees (Q2706115):
Displaying 24 items.
- Improved algorithms for maximum agreement and compatible supertrees (Q627540) (← links)
- Faster algorithms for computing the R* consensus tree (Q727985) (← links)
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850) (← 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)
- New common ancestor problems in trees and directed acyclic graphs (Q991797) (← links)
- An improved bound on the maximum agreement subtree problem (Q1036838) (← links)
- An improved algorithm for the maximum agreement subtree problem (Q1041753) (← links)
- On the agreement of many trees (Q1352115) (← links)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- On the extremal maximum agreement subtree problem (Q2197478) (← links)
- On the complexity of finding a largest common subtree of bounded degree (Q2348030) (← links)
- Succinct representations of weighted trees supporting path queries (Q2376795) (← links)
- On finding the Adams consensus tree (Q2407110) (← links)
- Maximum agreement and compatible supertrees (Q2466022) (← links)
- From constrained to unconstrained maximum agreement subtree in linear time (Q2479535) (← links)
- An algebraic view of the relation between largest common subtrees and smallest common supertrees (Q2508961) (← links)
- Efficient Algorithms for SNP Haplotype Block Selection Problems (Q3511342) (← links)
- On the Maximum Agreement Subtree Conjecture for Balanced Trees (Q5028359) (← links)
- Tree Containment With Soft Polytomies (Q5084686) (← links)
- (Q5116473) (← links)
- Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract) (Q5150927) (← links)
- Algorithms and Computation (Q5712163) (← links)
- Efficient computation of 2-medians in a tree network with positive/negative weights (Q5920599) (← links)
