On reduced amino acid alphabets for phylogenetic inference.
We investigate the use of Markov models of evolution for reduced amino acid alphabets or bins of amino acids. The use of reduced amino acid alphabets can ameliorate effects of model misspecification and saturation. We present algorithms for 2 different ways of automating the construction of bins: minimizing criteria based on properties of rate matrices and minimizing criteria based on properties of alignments. By simulation, we show that in the absence of model misspecification, the loss of information due to binning is found to be insubstantial, and the use of Markov models at the binned level is found to be almost as effective as the more appropriate missing data approach. By applying these approaches to real data sets where compositional heterogeneity and/or saturation appear to be causing biased tree estimation, we find that binning can improve topological estimation in practice.
Susko
Edward
E
Department of Mathematics and Statistics, Dalhousie University, Halifax, Nova Scotia, Canada. susko@mathstat.dal.ca
Roger
Andrew J
AJ
D000465:Algorithms; D000595:Amino Acid Sequence; D000596:Amino Acids / Q000737:chemistry / Q000235:genetics*; D000818:Animals; D002736:Chloroplasts / Q000235:genetics; D003198:Computer Simulation; D008390:Markov Chains; D024101:Mitochondrial Proteins / Q000737:chemistry / Q000235:genetics; D008969:Molecular Sequence Data; D009687:Nuclear Proteins / Q000737:chemistry / Q000235:genetics; D010802:Phylogeny; D010940:Plant Proteins / Q000737:chemistry / Q000235:genetics; D010944:Plants / Q000145:classification / Q000235:genetics; D020539:Sequence Analysis, Protein
D000596:Amino Acids; D024101:Mitochondrial Proteins; D009687:Nuclear Proteins; D010940:Plant Proteins