Mathematical aspects of phylogenetic groves
From MaRDI portal
Publication:360362
DOI10.1007/S00026-013-0179-4zbMATH Open1301.92051arXiv1104.2562OpenAlexW2963695183MaRDI QIDQ360362FDOQ360362
Publication date: 26 August 2013
Published in: Annals of Combinatorics (Search for Journal in Brave)
Abstract: The inference of new information on the relatedness of species by phylogenetic trees based on DNA data is one of the main challenges of modern biology. But despite all technological advances, DNA sequencing is still a time-consuming and costly process. Therefore, decision criteria would be desirable to decide a priori which data might contribute new information to the supertree which is not explicitly displayed by any input tree. A new concept, so-called groves, to identify taxon sets with the potential to construct such informative supertrees was suggested by An'e et al. in 2009. But the important conjecture that maximal groves can easily be identified in a database remained unproved and was published on the Isaac Newton Institute's list of open phylogenetic problems. In this paper, we show that the conjecture does not generally hold, but also introduce a new concept, namely 2-overlap groves, which overcomes this problem.
Full work available at URL: https://arxiv.org/abs/1104.2562
Recommendations
Applications of graph theory (05C90) Genetics and epigenetics (92D10) Problems related to evolution (92D15)
Cites Work
- The Steiner problem in phylogeny is NP-complete
- Finding a maximum likelihood tree is hard
- Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
- Phylogenetic supertrees. Combining information to reveal the tree of life
- Extension operations on sets of leaf-labelled trees
- Groves of phylogenetic trees
Cited In (7)
This page was built for publication: Mathematical aspects of phylogenetic groves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q360362)