| First Author | Liu EY | Year | 2010 |
| Journal | Bioinformatics | Volume | 26 |
| Issue | 12 | Pages | i199-207 |
| PubMed ID | 20529906 | Mgi Jnum | J:295215 |
| Mgi Id | MGI:6445162 | Doi | 10.1093/bioinformatics/btq187 |
| Citation | Liu EY, et al. (2010) Efficient genome ancestry inference in complex pedigrees with inbreeding. Bioinformatics 26(12):i199-207 |
| abstractText | MOTIVATION: High-density SNP data of model animal resources provides opportunities for fine-resolution genetic variation studies. These genetic resources are generated through a variety of breeding schemes that involve multiple generations of matings derived from a set of founder animals. In this article, we investigate the problem of inferring the most probable ancestry of resulting genotypes, given a set of founder genotypes. Due to computational difficulty, existing methods either handle only small pedigree data or disregard the pedigree structure. However, large pedigrees of model animal resources often contain repetitive substructures that can be utilized in accelerating computation. RESULTS: We present an accurate and efficient method that can accept complex pedigrees with inbreeding in inferring genome ancestry. Inbreeding is a commonly used process in generating genetically diverse and reproducible animals. It is often carried out for many generations and can account for most of the computational complexity in real-world model animal pedigrees. Our method builds a hidden Markov model that derives the ancestry probabilities through inbreeding process without explicit modeling in every generation. The ancestry inference is accurate and fast, independent of the number of generations, for model animal resources such as the Collaborative Cross (CC). Experiments on both simulated and real CC data demonstrate that our method offers comparable accuracy to those methods that build an explicit model of the entire pedigree, but much better scalability with respect to the pedigree size. |
