On finding the Adams consensus tree
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1974599 (Why is no real title available?)
- scientific article; zbMATH DE number 1512678 (Why is no real title available?)
- scientific article; zbMATH DE number 1865935 (Why is no real title available?)
- Algorithms in bioinformatics. A practical introduction.
- An \(O(n\log n)\) algorithm for the maximum agreement subtree problem for binary trees
- Consensus n-trees
- Fast Algorithms for Finding Nearest Common Ancestors
- Fast comparison of evolutionary trees
- Improved algorithms for constructing consensus trees
- N-trees as nestings: Complexity, similarity, and consensus
- PAUP*
- Succinct Orthogonal Range Search Structures on a Grid with Applications to Text Indexing
- The level ancestor problem simplified
- The mean, variance and limiting distribution of two statistics sensitive to phylogenetic tree balance
Cited in
(3)
This page was built for publication: On finding the Adams consensus tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2407110)