|
|||||
|
|
An algorithm to approximate the likelihood for pedigree data with loops by cutting |
|
| Authors: | C. Stricker R. L. Fernando R. C. Elston |
| Affiliation: | (1) Present address: Institute of Animal Sciences, Swiss Federal Institute of Technology, ETH-Zentrum, CLU, CH-8092 Zürich, Switzerland;(2) Department of Biometry and Genetics and the Center for Molecular and Human Genetics, Louisiana State University, Medical Center, 1901 Perdido Street, 70112-1393 New Orleans, USA;(3) Department of Animal Sciences, University of Illinois at UrbanaChampaign, 1207 West Gregory Drive, 61801 Urbana, IL, USA |
| 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. |
| Keywords: | Arbitrary pedigrees with loops Recursive algorithm Peeling Likelihood Cutting loops |
| 本文献已被 SpringerLink 等数据库收录！ | |