An Efficient Algorithm for the Additive Kinship Matrix

In this article we show how object-oriented programming can provide an efficient method for calculating kinship coefficients for very large pedigrees - large in number of individuals or generations, or both. We call our approach the "compressed kinship matrix." We use Java as our object-or...

Full description

Saved in:
Bibliographic Details
Published inThe Journal of heredity Vol. 93; no. 6; pp. 453 - 456
Main Authors Backus, V., Gilpin, M.
Format Journal Article
LanguageEnglish
Published United States Oxford University Press 01.11.2002
Oxford Publishing Limited (England)
Subjects
Algorithms
Animals
Family
Humans
Matrix
Models, Genetic
Pedigree
Software
Online AccessGet full text

Cover

More Information
Summary:In this article we show how object-oriented programming can provide an efficient method for calculating kinship coefficients for very large pedigrees - large 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. [PUBLICATION ABSTRACT]
Bibliography:Address all correspondence to Vickie Backus at the address above, or e-mail: vickie.backus@geog.utah.edu.
ark:/67375/HXZ-4RK3DB00-5
istex:272857F92A564BB3810E18E7E72C1BE5A18CF577
local:453
ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:0022-1503
1465-7333
DOI:10.1093/jhered/93.6.453