J. Anim Sci.
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
QUICK SEARCH:   [advanced]


     

This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Thallman, R. M.
Right arrow Articles by Kappes, S. M.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Thallman, R. M.
Right arrow Articles by Kappes, S. M.

Journal of Animal Science, Vol 79, Issue 1 26-33, Copyright © 2001 by American Society of Animal Science

JOURNAL ARTICLE

Efficient computation of genotype probabilities for loci with many alleles: I. Allelic peeling

R. M. Thallman, G. L. Bennett, J. W. Keele and S. M. Kappes
USDA, ARS, Roman L. Hruska U.S. Meat Animal Research Center, Clay Center, NE 68933-0166, USA. thallman@email.marc.usda.gov

Genetic marker data are likely to be obtained from a relatively small proportion of the individuals in many livestock populations. Information from genetic markers can be extrapolated to related individuals without marker data by computing genotype probabilities using an algorithm referred to as peeling. However, genetic markers may have many alleles and the number of computations in traditional peeling algorithms is proportional to the number of alleles raised to the sixth or eighth power, depending on pedigree structure. An alternative algorithm for computing genotype probabilities of marker loci with many alleles in large, nonlooped pedigrees with incomplete marker data is presented. The algorithm is based on recursive computations depending on alleles instead of genotypes, as in traditional peeling algorithms. The number of computations in the allelic peeling algorithm presented here is proportional to the square of the number of alleles, which makes this algorithm more computationally efficient than traditional peeling for loci with many alleles. Memory requirements are roughly proportional to the number of individuals in the pedigree and the number of alleles. The recursive allelic peeling algorithm cannot be applied to pedigrees that include full sibs or loops. However, it is a preliminary step toward a more complex and encompassing iterative approach to be described in a companion paper.


This article has been cited by other articles:


Home page
 J ANIM SCIHome page
M. L. Spangler, R. L. Sapp, J. K. Bertrand, M. D. MacNeil, and R. Rekaya
Different methods of selecting animals for genotyping to maximize the amount of genetic information known in the population
J Anim Sci, October 1, 2008; 86(10): 2471 - 2479.
[Abstract] [Full Text] [PDF]

Home page
 J ANIM SCIHome page
J. W. Walker, E. S. Campbell, C. J. Lupton, C. A. Taylor Jr., D. F. Waldron, and S. Y. Landau
Effects of breed, sex, and age on the variation and ability of fecal near-infrared reflectance spectra to predict the composition of goat diets
J Anim Sci, February 1, 2007; 85(2): 518 - 526.
[Abstract] [Full Text] [PDF]

Home page
 J HeredHome page
D. P. O'Brien, G. S. Johnson, R. D. Schnabel, S. Khan, J. R. Coates, G. C. Johnson, and J. F. Taylor
Genetic Mapping of Canine Multiple System Degeneration and Ectodermal Dysplasia Loci
J. Hered., November 1, 2005; 96(7): 727 - 734.
[Abstract] [Full Text] [PDF]

Home page
 Proc. Natl. Acad. Sci. USAHome page
R. D. Schnabel, J.-J. Kim, M. S. Ashwell, T. S. Sonstegard, C. P. Van Tassell, E. E. Connor, and J. F. Taylor
Fine-mapping milk production quantitative trait loci on BTA6: Analysis of the bovine osteopontin gene
PNAS, May 10, 2005; 102(19): 6896 - 6901.
[Abstract] [Full Text] [PDF]


HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
Copyright © 2001 by the American Society of Animal Science.