Tree Contractions and Evolutionary Trees
From MaRDI portal
Publication:4210124
Recommendations
Cited in
(8)- Computing the maximum agreement of phylogenetic networks
- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees
- From constrained to unconstrained maximum agreement subtree in linear time
- Approximating the nearest neighbor intercharge distance for non-uniform-degree evolutionary trees
- Average case analysis for tree labelling schemes
- The asymmetric median tree. --- A new model for building consensus trees
- Improved algorithms for maximum agreement and compatible supertrees
- An improved algorithm for the maximum agreement subtree problem
This page was built for publication: Tree Contractions and Evolutionary Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4210124)