An Efficient Algorithm for the Additive Kinship Matrix

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of Heredity 2002-11, Vol.93 (6), p.453-456
Hauptverfasser: Backus, V., Gilpin, M.
Format: Artikel
Sprache:eng
Schlagworte:
Algorithms
Animals
Family
Humans
Matrix
Models, Genetic
Pedigree
Software
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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]
ISSN:0022-1503
1471-8505
1465-7333
1471-8505
DOI:10.1093/jhered/93.6.453