City Research Online

Abstract

A simple and efficient algorithm is presented for finding a maximum likelihood pedigree using microsatellite (STR) genotype information on a complete sample of related individuals. The computational complexity of the algorithm is at worst (O(n32n)), where n is the number of individuals. Thus it is possible to exhaustively search the space of all pedigrees of up to thirty individuals for one that maximizes the likelihood. A priori age and sex information can be used if available, but is not essential. The algorithm is applied in a simulation study, and to some real data on humans.

Publication Type:	Article
Additional Information:	NOTICE: this is the author’s version of a work that was accepted for publication in Theoretical Population Biology. Changes resulting from the publishing process, such as peer review, editing, corrections, structural formatting, and other quality control mechanisms may not be reflected in this document. Changes may have been made to this work since it was submitted for publication. A definitive version was subsequently published in Theoretical Population Biology, Volume 76, Issue 4, December 2009, Pages 285–291, http://dx.doi.org/10.1016/j.tpb.2009.09.002.
Publisher Keywords:	Pedigree reconstruction; Bayesian network; Maximum likelihood
Subjects:	Q Science > QA Mathematics Q Science > QH Natural history > QH426 Genetics
Departments:	Bayes Business School > Actuarial Science & Insurance
Related URLs:	Author
SWORD Depositor:	Symplectic Administrator

Export

Downloads