메뉴 건너뛰기




Volumn 48, Issue 1, 1998, Pages 49-60

Automatic selection of loop breakers for genetic linkage analysis

Author keywords

Algorithms; Bayesian networks; Genetics; Linkage analysis; Loops; Probabilistic inference

Indexed keywords

ALGORITHM; ARTICLE; COMPUTER ANALYSIS; COMPUTER PROGRAM; GENETIC LINKAGE; PEDIGREE ANALYSIS;

EID: 0031972889     PISSN: 00015652     EISSN: None     Source Type: Journal    
DOI: 10.1159/000022781     Document Type: Article
Times cited : (43)

References (39)
  • 2
    • 0021344005 scopus 로고
    • Easy calculations of lod scores and genetic risks on small computers
    • Lathrop GM, Lalouel JM: Easy calculations of lod scores and genetic risks on small computers. Am J Hum Genet 1984;36:460-465.
    • (1984) Am J Hum Genet , vol.36 , pp. 460-465
    • Lathrop, G.M.1    Lalouel, J.M.2
  • 3
    • 0021850103 scopus 로고
    • Multilocus linkage analysis in humans: Detection of linkage and estimation of recombination
    • Lathrop GM, Lalouel JM, Julier C, Ott J: Multilocus linkage analysis in humans: Detection of linkage and estimation of recombination. Am J Hum Genet 1985;37:482-498.
    • (1985) Am J Hum Genet , vol.37 , pp. 482-498
    • Lathrop, G.M.1    Lalouel, J.M.2    Julier, C.3    Ott, J.4
  • 7
    • 0025913455 scopus 로고
    • Efficient methods for computing linkage likelihoods of recessive diseases in inbred pedigrees
    • Kong A: Efficient methods for computing linkage likelihoods of recessive diseases in inbred pedigrees. Genet Epidemiol 1991;8:81-103.
    • (1991) Genet Epidemiol , vol.8 , pp. 81-103
    • Kong, A.1
  • 8
    • 0015183542 scopus 로고
    • A general model for the analysis of pedigree data
    • Elston RC, Stewart J: A general model for the analysis of pedigree data. Hum Hered 1971;21:523-542.
    • (1971) Hum Hered , vol.21 , pp. 523-542
    • Elston, R.C.1    Stewart, J.2
  • 9
    • 0016732662 scopus 로고
    • Extensions to pedigree analysis. I. Likelihood calculation for simple and complex pedigrees
    • Lange K, Elston RC: Extensions to pedigree analysis. I. Likelihood calculation for simple and complex pedigrees. Hum Hered 1975;25:95-105.
    • (1975) Hum Hered , vol.25 , pp. 95-105
    • Lange, K.1    Elston, R.C.2
  • 12
    • 0016302483 scopus 로고
    • Estimation of the recombination fraction in human pedigrees: Efficient computation of the likelihood for human linkage studies
    • Ott J: Estimation of the recombination fraction in human pedigrees: Efficient computation of the likelihood for human linkage studies. Am J Hum Genet 1974;26:588-597.
    • (1974) Am J Hum Genet , vol.26 , pp. 588-597
    • Ott, J.1
  • 13
    • 0021047816 scopus 로고
    • Extensions to pedigree analysis. V. Optimal calculation of mendelian likelihoods
    • Lange K, Boehnke M: Extensions to pedigree analysis. V. Optimal calculation of mendelian likelihoods. Hum Hered 1983;33:291-301.
    • (1983) Hum Hered , vol.33 , pp. 291-301
    • Lange, K.1    Boehnke, M.2
  • 14
    • 0001006209 scopus 로고
    • Local computations with probabilities on graphical structures and their application to Expert Systems
    • Lauritzen SL, Spiegelhalter DJ: Local computations with probabilities on graphical structures and their application to Expert Systems (with discussion). J R Stat Soc B 1988;50: 157-224.
    • (1988) J R Stat Soc B , vol.50 , pp. 157-224
    • Lauritzen, S.L.1    Spiegelhalter, D.J.2
  • 15
    • 0026979104 scopus 로고
    • Finding approximate separators and computing the treewidth quickly
    • Victoria
    • Reed B: Finding approximate separators and computing the treewidth quickly. Proc 24th Annu ACM Symp Theory Comp, Victoria, 1992, pp 221-228.
    • (1992) Proc 24th Annu ACM Symp Theory Comp , pp. 221-228
    • Reed, B.1
  • 16
    • 0000241192 scopus 로고    scopus 로고
    • A sufficiently fast algorithm for finding close to optimal junction trees
    • Portland
    • Becker A, Geiger D: A sufficiently fast algorithm for finding close to optimal junction trees. Proc 12th Conf Uncertainty in Artif Intell, Portland, 1996, pp 81-88.
    • (1996) Proc 12th Conf Uncertainty in Artif Intell , pp. 81-88
    • Becker, A.1    Geiger, D.2
  • 17
    • 0031366907 scopus 로고    scopus 로고
    • A practical algorithm for finding optimal triangulations
    • Providence
    • Shoikhet K, Geiger D: A practical algorithm for finding optimal triangulations. Proc Am Assoc Artif Intell 97, Providence, 1997.
    • (1997) Proc Am Assoc Artif Intell 97
    • Shoikhet, K.1    Geiger, D.2
  • 18
    • 0008566195 scopus 로고
    • Finding all loops in a pedigree
    • Xie X, Ott J: Finding all loops in a pedigree. Am J Hum Genet 1992; 51:A205.
    • (1992) Am J Hum Genet , vol.51
    • Xie, X.1    Ott, J.2
  • 20
    • 46149134436 scopus 로고
    • Fusion, propagation and structuring in belief networks
    • Pearl J: Fusion, propagation and structuring in belief networks. Artif Intell 1986;29:241-288.
    • (1986) Artif Intell , vol.29 , pp. 241-288
    • Pearl, J.1
  • 21
    • 0020918216 scopus 로고
    • A computational model for combined causal and diagnostic reasoning in inference systems
    • Karlsruhe
    • Kim H, Pearl J: A computational model for combined causal and diagnostic reasoning in inference systems, Proc 8th Int Joint Conf Artif Intell, Karlsruhe, 1983, pp 190-193.
    • (1983) Proc 8th Int Joint Conf Artif Intell , pp. 190-193
    • Kim, H.1    Pearl, J.2
  • 22
    • 0022823859 scopus 로고
    • A constraint-propagation approach to probabilistic reasoning
    • Los Angeles
    • Pearl J: A constraint-propagation approach to probabilistic reasoning, Proc Works on Uncertainty and Probability in Artificial Intelligence, Los Angeles 1985, pp 31-42; also in Kanal LN, Lemmer JF (eds): Uncertainty in Artificial Intelligence. Amsterdam, North-Holland, 1986, pp 357-370.
    • (1985) Proc Works on Uncertainty and Probability in Artificial Intelligence , pp. 31-42
    • Pearl, J.1
  • 23
    • 0022823859 scopus 로고
    • Amsterdam, North-Holland
    • Pearl J: A constraint-propagation approach to probabilistic reasoning, Proc Works on Uncertainty and Probability in Artificial Intelligence, Los Angeles 1985, pp 31-42; also in Kanal LN, Lemmer JF (eds): Uncertainty in Artificial Intelligence. Amsterdam, North-Holland, 1986, pp 357-370.
    • (1986) Uncertainty in Artificial Intelligence , pp. 357-370
    • Kanal, L.N.1    Lemmer, J.F.2
  • 24
    • 84986959240 scopus 로고
    • Identifying independence in Bayesian networks
    • Geiger D, Verma TS, Pearl J: Identifying independence in Bayesian networks. Networks 1990;20:507-534.
    • (1990) Networks , vol.20 , pp. 507-534
    • Geiger, D.1    Verma, T.S.2    Pearl, J.3
  • 25
    • 38249019981 scopus 로고
    • Probabil istic inference in multiply connected belief networks using loop cutsets
    • Suermont HJ, Cooper GF: Probabil istic inference in multiply connected belief networks using loop cutsets. Int J Approx Reasoning 1990;4: 283-306.
    • (1990) Int J Approx Reasoning , vol.4 , pp. 283-306
    • Suermont, H.J.1    Cooper, G.F.2
  • 26
    • 0003037529 scopus 로고
    • Reducibility among combinatorial problems
    • Miller RE, Thatcher JW (eds): New York, Plenum Press
    • Karp RM: Reducibility among combinatorial problems: in Miller RE, Thatcher JW (eds): Complexity of Computer Computations. New York, Plenum Press, 1972, pp 85-103.
    • (1972) Complexity of Computer Computations , pp. 85-103
    • Karp, R.M.1
  • 27
    • 6844223857 scopus 로고    scopus 로고
    • Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference
    • in press
    • Bar-Yehuda R, Geiger D, Naor J, Roth RM: Approximation algorithms for the vertex feedback set problem with applications to constraint satisfaction and Bayesian inference SLAM J. Computing, in press.
    • SLAM J. Computing
    • Bar-Yehuda, R.1    Geiger, D.2    Naor, J.3    Roth, R.M.4
  • 29
    • 0030146208 scopus 로고    scopus 로고
    • Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem
    • Becker A, Geiger D: Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem. Artif Intell 1996;83:167-188.
    • (1996) Artif Intell , vol.83 , pp. 167-188
    • Becker, A.1    Geiger, D.2
  • 30
    • 84955602886 scopus 로고
    • Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs
    • Lecture Notes in Computer Science. Berlin, Springer
    • Bafna V, Berman P, Fujito T: Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs. Proc 6th Annu Int Symp Algorithms and Computation (ISAAC 95). Lecture Notes in Computer Science. Berlin, Springer, 1995. vol 1004, pp 142-151.
    • (1995) Proc 6th Annu Int Symp Algorithms and Computation (ISAAC 95) , vol.1004 , pp. 142-151
    • Bafna, V.1    Berman, P.2    Fujito, T.3
  • 31
    • 0029946879 scopus 로고    scopus 로고
    • Faster Linkage analysis computations for pedigrees with loops or unused alleles
    • Schäffer AA. Faster Linkage analysis computations for pedigrees with loops or unused alleles. Hum Hered 1996;46:226-235.
    • (1996) Hum Hered , vol.46 , pp. 226-235
    • Schäffer, A.A.1
  • 32
    • 0004201430 scopus 로고
    • Rockville, Computer Science Press
    • Even S: Graph Algorithms. Rockville, Computer Science Press, 1979.
    • (1979) Graph Algorithms
    • Even, S.1
  • 33
    • 70350674995 scopus 로고
    • On the shortest spanning subtree of a graph and the traveling salesman problem
    • Kruskal JB: On the shortest spanning subtree of a graph and the traveling salesman problem. Proc Am Math Soc 1956;7:48-50.
    • (1956) Proc Am Math Soc , vol.7 , pp. 48-50
    • Kruskal, J.B.1
  • 37
    • 0029845713 scopus 로고    scopus 로고
    • Limb-girdle muscular dystrophy and Miyoshi myopatay in an aboriginal Canadian kindred map to LGMD2B and segregate with the same haplotype
    • Weiler T, Greenberg CR, Nylen E, Halliday W, Morgan K, Eggerston D, Wrogemann K: Limb-girdle muscular dystrophy and Miyoshi myopatay in an aboriginal Canadian kindred map to LGMD2B and segregate with the same haplotype. Am J Hum Genet 1996;59:872-878.
    • (1996) Am J Hum Genet , vol.59 , pp. 872-878
    • Weiler, T.1    Greenberg, C.R.2    Nylen, E.3    Halliday, W.4    Morgan, K.5    Eggerston, D.6    Wrogemann, K.7
  • 39
    • 0028790963 scopus 로고
    • The VITESSE algorithm for rapid exact multilocus linkage analysis via genotype set-recording and fuzzy inheritance
    • O'Connell JR, Weeks DE: The VITESSE algorithm for rapid exact multilocus linkage analysis via genotype set-recording and fuzzy inheritance. Nat Genet 1995;11:402-408.
    • (1995) Nat Genet , vol.11 , pp. 402-408
    • O'Connell, J.R.1    Weeks, D.E.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.