Mathematical aspects of phylogenetic groves
From MaRDI portal
Publication:360362
DOI10.1007/s00026-013-0179-4zbMath1301.92051arXiv1104.2562OpenAlexW2963695183MaRDI QIDQ360362
Publication date: 26 August 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1104.2562
Problems related to evolution (92D15) Applications of graph theory (05C90) Genetics and epigenetics (92D10)
Cites Work
- Groves of phylogenetic trees
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
- The Steiner problem in phylogeny is NP-complete
- Phylogenetic supertrees. Combining information to reveal the tree of life
- Extension operations on sets of leaf-labelled trees
- Finding a maximum likelihood tree is hard
This page was built for publication: Mathematical aspects of phylogenetic groves