Literature DB >> 3453835

Optimal computation of probability functions for pedigree analysis.

A Thomas1.   

Abstract

The problem of finding optimal peeling sequences is considered, and a correspondence between sequences and permutations of marriages is established. Several search methods, including random downhill search and the annealing algorithm, are compared. The topology of the space of all peeling sequences is discussed.

Mesh:

Year:  1986        PMID: 3453835     DOI: 10.1093/imammb/3.3.167

Source DB:  PubMed          Journal:  IMA J Math Appl Med Biol        ISSN: 0265-0746


  2 in total

1.  An approximation to the likelihood for a pedigree with loops.

Authors:  T Wang; R L Fernando; C Stricker; R C Elston
Journal:  Theor Appl Genet       Date:  1996-12       Impact factor: 5.699

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

Authors:  C Stricker; R L Fernando; R C Elston
Journal:  Theor Appl Genet       Date:  1995-11       Impact factor: 5.699

  2 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.