An algorithm to approximate the likelihood for pedigree data with loops by cutting

Abstract

This paper presents a recursive algorithm to approximate the likelihood in arbitrary pedigrees with loops. The algorithm handles any number and nesting levels of loops in pedigrees. The loops are cut as described in a previous publication and the approximate likelihood is simultaneously computed using the cut pedigree. No identification of a loop in the pedigree is necessary before the algorithm is applied.

DOI: 10.1007/BF00223919

10 Figures and Tables

Statistics

050100150'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

407 Citations

Semantic Scholar estimates that this publication has 407 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Stricker1995AnAT, title={An algorithm to approximate the likelihood for pedigree data with loops by cutting}, author={Christian Stricker and Rohan L. Fernando and Robert C. Elston}, journal={Theoretical and Applied Genetics}, year={1995}, volume={91}, pages={1054-1063} }