ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Likelihood  (2)
  • 1995-1999  (2)
  • 1
    Digitale Medien
    Digitale Medien
    Springer
    Theoretical and applied genetics 91 (1995), S. 1054-1063 
    ISSN: 1432-2242
    Schlagwort(e): Arbitrary pedigrees with loops ; Recursive algorithm ; Peeling ; Likelihood ; Cutting loops
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie
    Notizen: 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.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
  • 2
    Digitale Medien
    Digitale Medien
    Springer
    Theoretical and applied genetics 93 (1996), S. 1299-1309 
    ISSN: 1432-2242
    Schlagwort(e): Likelihood ; Peeling ; Pedigree with loops ; Segregation analysis ; Linkage analysis
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Biologie
    Notizen: 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.
    Materialart: Digitale Medien
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...