A simple greedy algorithm for reconstructing pedigrees

Cowell, R. (2013). A simple greedy algorithm for reconstructing pedigrees. Theoretical Population Biology, 83, pp. 55-63. doi: 10.1016/j.tpb.2012.11.002

PDF - Accepted Version
Download (1MB) | Preview


This paper introduces a simple greedy algorithm for searching for high likelihood pedigrees using micro-satellite (STR) genotype information on a complete sample of related individuals. The core idea behind the algorithm is not new, but it is believed that putting it into a greedy search setting, and specifically the application to pedigree learning, is novel. The algorithm does not require age or sex information, but this information can be incorporated if desired. The algorithm is applied to human and non-human genetic data and in a simulation study.

Item 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 83, February 2013, Pages 55–63, http://dx.doi.org/10.1016/j.tpb.2012.11.002
Uncontrolled Keywords: Pedigree reconstruction; Maximum likelihood pedigree; Greedy search
Subjects: Q Science > QA Mathematics
Q Science > QH Natural history > QH426 Genetics
Divisions: Cass Business School > Faculty of Actuarial Science & Insurance
Related URLs:
URI: http://openaccess.city.ac.uk/id/eprint/6011

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics