4.0 Article

A simple greedy algorithm for reconstructing pedigrees

Journal

THEORETICAL POPULATION BIOLOGY
Volume 83, Issue -, Pages 55-63

Publisher

ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.tpb.2012.11.002

Keywords

Pedigree reconstruction; Maximum likelihood pedigree; Greedy search

Ask authors/readers for more resources

This paper introduces a simple greedy algorithm for searching for high likelihood pedigrees using microsatellite (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. (C) 2012 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.0
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available