PoMo : an allele frequency-based approach for species tree estimation
MetadataShow full item record
Incomplete lineage sorting can cause incongruencies of the overall species-level phylogenetic tree with the phylogenetic trees for individual genes or genomic segments. If these incongruencies are not accounted for, it is possible to incur several biases in species tree estimation. Here, we present a simple maximum likelihood approach that accounts for ancestral variation and incomplete lineage sorting. We use a POlymorphisms-aware phylogenetic MOdel (PoMo) that we have recently shown to efficiently estimate mutation rates and fixation biases from within and between-species variation data. We extend this model to perform efficient estimation of species trees. We test the performance of PoMo in several different scenarios of incomplete lineage sorting using simulations and compare it with existing methods both in accuracy and computational speed. In contrast to other approaches, our model does not use coalescent theory but is allele frequency based. We show that PoMo is well suited for genome-wide species tree estimation and that on such data it is more accurate than previous approaches.
De Maio , N , Schrempf , D & Kosiol , C 2015 , ' PoMo : an allele frequency-based approach for species tree estimation ' Systematic Biology , vol. 64 , no. 6 , pp. 1018-31 . DOI: 10.1093/sysbio/syv048
© The Author(s) 2015. Published by Oxford University Press, on behalf of the Society of Systematic Biologists. This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/4.0/), which permits non-commercial re-use, distribution, and reproduction in any medium, provided the original work is properly cited. For commercial re-use, please contact firstname.lastname@example.org
Description© The Author(s) 2015. Published by Oxford University Press, on behalf of the Society of Systematic Biologists.
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.