The following pages link to (Q3128909):
Displaying 13 items.
- Parameterized and approximation algorithms for maximum agreement forest in multifurcating trees (Q476897) (← links)
- A survey on tree edit distance and related problems (Q557823) (← links)
- Improved algorithms for maximum agreement and compatible supertrees (Q627540) (← links)
- On the parameterized complexity of the multi-MCT and multi-MCST problems (Q630185) (← links)
- Fast compatibility testing for rooted phylogenetic trees (Q724246) (← links)
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees (Q845850) (← links)
- On the agreement of many trees (Q1352115) (← links)
- Computing the maximum agreement of phylogenetic networks (Q1781993) (← links)
- From constrained to unconstrained maximum agreement subtree in linear time (Q2479535) (← links)
- (Q4471991) (← links)
- Computing the unrooted maximum agreement subtree in sub-quadratic time (Q5054809) (← links)
- On the complexity of comparing evolutionary trees (Q5961623) (← links)
- Finding smallest supertrees (Q6487952) (← links)
