Selecting loop breakers in general pedigrees

Human Heredity

Volumn 57, Issue 1, 2004, Pages 1-9

  Vitezica, Zulma G ^a   Mongeau, Marcel ^b   Manfredi, Eduardo ^a   Elsen, Jean Michel ^a  

^a CEMAGREF   (France)

^b UNIVERSITÉ PAUL SABATIER   (France)

Author keywords

Cycles; Dynamic programming; Graph theory; Loops breakers; Pedigree

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER PROGRAM; MARRIAGE; MATHEMATICAL GENETICS; PEDIGREE; PEDIGREE ANALYSIS; QUANTITATIVE GENETICS; SIMULATION;

ALGORITHMS; FEMALE; GENOTYPE; HUMANS; LIKELIHOOD FUNCTIONS; LINKAGE (GENETICS); MALE; MODELS, GENETIC; MODELS, STATISTICAL; NUCLEAR FAMILY; PEDIGREE; SOFTWARE; STATISTICS; TIME FACTORS;

EID: 2342485507     PISSN: 00015652     EISSN: None     Source Type: Journal    
DOI: 10.1159/000077384     Document Type: Article

References (17)

1. Elston RC, Stewart J: A general model for the genetic analysis of pedigree data. Hum Hered 1971;21:523-542.
2. Lange K, Elston RC: Extentions to pedigree analysis. I. Likelihood calculations for simple and complex pedigrees. Hum Hered 1975;25:95-105.
3. Cannings C, Thompson EA, Skolnick EH: Probability functions on complex pedigrees. Adv Appl Prob 1978;10:26-61.
4. Lange K, Boehnke M: Extensions to pedigree analysis. V. Optimal calculation of Mendelian Likelihoods. Hum Hered 1986, 33:291-301.
5. Wang T, Fernando RL, Stricker C, Elston RC: An approximation to the likelihood for a pedigree with loops. Theor Appl Genet 1996;93:1299-1309.
6. Xie X, Ott J: Finding all loops in a pedigree. Am J Hum Genet 1992;51:A205.
7. Becker A, Geiger D, Schäffer AA: Automatic selection of loop breakers for genetic linkage analysis. Hum Hered 1998;48:49-60.
8. Becker A, Bar-Yehuda R, Geiger D: Random algorithms for the loop cutset problem. J Artif Intell Res 2000;12:219-234.
9. Stricker C, Fernando RL, Elston RC: An algorithm to approximate the likelihood for pedigree data with loops by cutting. Theor Appl Genet 1995;91:1054-1063.
10. O'Connell JR, Weeks DE: An optimal algorithm for automatic genotype elimination. Am J Hum Genet 1999;65:1733-1740.
11. Cottingham Jr RW, Idury RM, Schaffer AA: Faster sequential genetic linkage computations. Am J Hum Genet 1993;53:252-263.
12. Schaffer AA, Gupta SK, Shriram K, Cottingham Jr RW: Avoiding recomputation in linkage analysis. Hum Hered 1994;44:225-237.
13. Berge C: Graphes. Gauthier-Villars, Paris, 1970.
14. Festa P, Pardalos PM, Resende MGC: Feedback set problems; in C Flouda, PM Pardalos (eds): Encyclopedia of Optimization. Kluwer Academic Press, 2001, vol 2, pp. 94-106.
15. Charon I, Germa A, Hudry O : Méthodes d'optimisation combinatoire. Masson, Paris, 1996.
16. Bradley S P, Hax A C, Magnanti T L: Applied Mathematical Programming. Addison-Wesley, 1977.
17. Lange K, Goradia TM: An algorithm for automatic genotype elimination. Am J Hum Genet 1987;40:250-256.