ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Likelihood  (2)
  • 1995-1999  (2)
  • 1
    Electronic Resource
    Electronic Resource
    An approximation to the likelihood for a pedigree with loops (1996)
    Springer
    Theoretical and applied genetics 93 (1996), S. 1299-1309 
    Details
    ISSN: 1432-2242
    Keywords: Likelihood ; Peeling ; Pedigree with loops ; Segregation analysis ; Linkage analysis
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract This paper presents a new approximation to the likelihood for a pedigree with loops, based on cutting all loops and extending the pedigree at the cuts. An opimum loop-cutting strategy and an iterative extension technique are presented. The likelihood for a pedigree with loops is then approximated by the conditional likelihood for the entire cut-extended pedigree given the extended part. The approximate likelihoods are compared with the exact likelihoods obtained using the program MENDEL for several small pedigrees with loops. The approximation is efficient for large pedigrees with complex loops in terms of computing speed and memory requirements.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00223463
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    An algorithm to approximate the likelihood for pedigree data with loops by cutting (1995)
    Springer
    Theoretical and applied genetics 91 (1995), S. 1054-1063 
    Details
    ISSN: 1432-2242
    Keywords: Arbitrary pedigrees with loops ; Recursive algorithm ; Peeling ; Likelihood ; Cutting loops
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: 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.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00223919
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...