ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

feed icon rss

Your email was sent successfully. Check your inbox.

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

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Theoretical and applied genetics 88 (1994), S. 573-580 
    ISSN: 1432-2242
    Keywords: Mixed model inheritance ; Likelihood
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract This paper presents a mixed model of inheritance with a finite number of polygenic loci. This model leads to a likelihood that can be calculated using efficient algorithms developed for oligogenic models. For comparison, likelihood profiles were obtained for the finite polygenic mixed model, the usual mixed model, with exact and approximate calculations, and for a class D regressive model. The profiles for the finite polygenic mixed model were closest to the profiles for the usual mixed model with exact calculations.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Theoretical and applied genetics 93 (1996), S. 1299-1309 
    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
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Theoretical and applied genetics 91 (1995), S. 1054-1063 
    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
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
  • 4
    Electronic Resource
    Electronic Resource
    Springer
    Theoretical and applied genetics 87 (1993), S. 89-93 
    ISSN: 1432-2242
    Keywords: Genotype probabilities ; Likelihood ; Recursive algorithm
    Source: Springer Online Journal Archives 1860-2000
    Topics: Biology
    Notes: Abstract This paper describes a non-iterative, recursive method to compute the likelihood for a pedigree without loops, and hence an efficient way to compute genotype probabilities for every member of the pedigree. The method can be used with multiple mates and large sibships. Scaling is used in calculations to avoid numerical problems in working with large pedigrees.
    Type of Medium: Electronic Resource
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...