Groves of phylogenetic trees
DOI10.1007/s00026-009-0017-xzbMath1231.92051OpenAlexW2092417212WikidataQ60601610 ScholiaQ60601610MaRDI QIDQ659789
Michael J. Sanderson, Raul Piaggio-Talice, Cécile Ané, Oliver Eulenstein
Publication date: 24 January 2012
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00026-009-0017-x
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Trees (05C05) Problems related to evolution (92D15) Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (2)
Cites Work
- Unnamed Item
- The Steiner problem in phylogeny is NP-complete
- The complexity of reconstructing trees from qualitative characters and subtrees
- Phylogenetic supertrees. Combining information to reveal the tree of life
- Extension operations on sets of leaf-labelled trees
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
This page was built for publication: Groves of phylogenetic trees