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 5 items.
- Comparing and aggregating partially resolved trees (Q650896) (← links)
- Faster algorithms for computing the R* consensus tree (Q727985) (← 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)
- Constructing the R* consensus tree of two trees in subcubic time (Q1950390) (← links)
