Pages that link to "Item:Q1041753"
From MaRDI portal
The following pages link to An improved algorithm for the maximum agreement subtree problem (Q1041753):
Displaying 14 items.
- Comparing and aggregating partially resolved trees (Q650896) (← 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 improved algorithm for finding a length-constrained maximum-density subtree in a tree (Q975556) (← links)
- An efficient strategy for generating all descendant subtree patterns from phylogenetic trees with its implementation (Q990618) (← links)
- Constructing the R* consensus tree of two trees in subcubic time (Q1950390) (← links)
- On the extremal maximum agreement subtree problem (Q2197478) (← links)
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees (Q2706115) (← links)
- An Analysis of a Good Algorithm for the Subtree Problem, Corrected (Q3833624) (← links)
- Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms (Q4376196) (← links)
- Computing the unrooted maximum agreement subtree in sub-quadratic time (Q5054809) (← links)
- Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q5252691) (← links)
- Algorithms and Computation (Q5712163) (← links)
