The following pages link to SPRSupertrees (Q26580):
Displayed 14 items.
- Computing nearest neighbour interchange distances between ranked phylogenetic trees (Q96718) (← links)
- Fixed-parameter and approximation algorithms for maximum agreement forests of multifurcating trees (Q270010) (← links)
- Reduction rules for the maximum parsimony distance on phylogenetic trees (Q306268) (← links)
- Improved approximation algorithm for maximum agreement forest of two rooted binary phylogenetic trees (Q328699) (← links)
- On the enumeration of tanglegrams and tangled chains (Q346449) (← links)
- Approximating maximum agreement forest on multiple binary trees (Q727962) (← links)
- A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees (Q1671997) (← links)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- Reflections on kernelizing and computing unrooted agreement forests (Q2069261) (← links)
- A practical fixed-parameter algorithm for constructing tree-child networks from multiple binary trees (Q2118383) (← links)
- Maximum parsimony distance on phylogenetic trees: a linear kernel and constant factor approximation algorithm (Q2221808) (← links)
- Reconciliation of a gene network and species tree (Q2415826) (← links)
- Phylogenetic incongruence through the lens of Monadic Second Order logic (Q2790162) (← links)
- (Q5111745) (← links)