title: Efficient exact maximum a posteriori computation for bayesian SNP genotyping in polyploids.
abstract: The problem of genotyping polyploids is extremely important for the creation of genetic maps and assembly of complex plant genomes. Despite its significance, polyploid genotyping still remains largely unsolved and suffers from a lack of statistical formality. In this paper a graphical bayesian model for SNP genotyping data is introduced. This model can infer genotypes even when the ploidy of the population is unknown. We also introduce an algorithm for finding the exact maximum a posteriori genotype configuration with this model. This algorithm is implemented in a freely available web-based software package SuperMASSA. We demonstrate the utility, efficiency, and flexibility of the model and algorithm by applying them to two different platforms, each of which is applied to a polyploid data set: Illumina GoldenGate data from potato and Sequenom MassARRAY data from sugarcane. Our method achieves state-of-the-art performance on both data sets and can be trivially adapted to use models that utilize prior information about any platform or species.
authors.affiliation: Department of Neurobiology, Harvard Medical School, Boston, Massachusetts, United States of America. Oliver.Serang@Childrens.Harvard.edu
authors.forename: Oliver
authors.initials: O
authors.lastname: Serang
authors.forename: Marcelo
authors.initials: M
authors.lastname: Mollinari
authors.forename: Antonio Augusto Franco
authors.initials: AA
authors.lastname: Garcia
mesh_terms: D000465:Algorithms; D001499:Bayes Theorem; D019295:Computational Biology / Q000379:methods*; D030541:Databases, Genetic; D056426:Genetic Loci / Q000235:genetics; D060005:Genotyping Techniques / Q000379:methods*; D020641:Polymorphism, Single Nucleotide / Q000235:genetics*; D011123:Polyploidy; D031786:Saccharum / Q000235:genetics*; D012984:Software; D011198:Solanum tuberosum / Q000235:genetics*; D013997:Time Factors