The Journal of Heredity 2002:93(6)
© 2002 The American Genetic Association 93:453-456
Computer Note |
An Efficient Algorithm for the Additive Kinship Matrix
From the University of Utah, Department of Geography, Salt Lake City, UT 84112, and Montana State University, Department of Ecology and Evolution, Bozeman, MT 59717.
Address all correspondence to Vickie Backus at the address above, or e-mail: vickie.backus@geog.utah.edu.
| The first 150 words of the full text of this article appear below. |
In this article we show how object-oriented programming can provide an efficient method for calculating kinship coefficients for very large pedigreeslarge in number of individuals or generations, or both. We call our approach the "compressed kinship matrix." We use Java as our object-oriented language, but the algorithm should be similarly implemented in other object-oriented languages. The documented source code and illustrative Java applets are available on our Web site: www.consbio.com/kinshipAlgorithm.
Specification of the genealogical relationships between all individuals in a population is the most complete and fundamental nonempirical genetic analysis one can perform (Lacy et al. 1995). Kinship, the probability that two individuals share alleles identical by descent, plays a central role in the study of these relationships (Thompson 1976). Although first utilized for human pedigrees, it is also important for the genetic management of animals in captive or domesticated settings for which exact paternity