scientific article; zbMATH DE number 432794
From MaRDI portal
Publication:3138927
Cited in
(4)- An \(O(n\log n)\)-time algorithm for the maximum constrained agreement subtree problem for binary trees
- A robust model for finding optimal evolutionary tree
- Reconstruction of rooted trees from subtrees
- An \(O(n)\) algorithm for finding an optimal position with relative distances in an evolutionary tree
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3138927)