메뉴 건너뛰기




Volumn , Issue , 2011, Pages

A global structural em algorithm for a model of cancer progression

Author keywords

[No Author keywords available]

Indexed keywords

DISEASES; LEARNING ALGORITHMS;

EID: 85162483791     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (12)

References (22)
  • 1
    • 84933530882 scopus 로고
    • Approximating discrete probability distributions with dependence trees
    • C. Chow and C. Liu. Approximating discrete probability distributions with dependence trees. IEEE Trans Inform Theor, 14(3):462-467, 1968.
    • (1968) IEEE Trans Inform Theor , vol.14 , Issue.3 , pp. 462-467
    • Chow, C.1    Liu, C.2
  • 2
    • 24044550075 scopus 로고    scopus 로고
    • Learning with mixtures of trees
    • M. Meila and M.I. Jordan. Learning with mixtures of trees. J Mach Learn Res, 1(1):1-48, 2000.
    • (2000) J Mach Learn Res , vol.1 , Issue.1 , pp. 1-48
    • Meila, M.1    Jordan, M.I.2
  • 3
    • 0036110773 scopus 로고    scopus 로고
    • A structural em algorithm for phylogenetic inference
    • N. Friedman, M. Ninio, I. Pe'er, and T. Pupko. A structural em algorithm for phylogenetic inference. J Comput Biol, 9(2):331-353, 2002.
    • (2002) J Comput Biol , vol.9 , Issue.2 , pp. 331-353
    • Friedman, N.1    Ninio, M.2    Pe'er, I.3    Pupko, T.4
  • 7
    • 33745296683 scopus 로고    scopus 로고
    • New probabilistic network models and algorithms for oncogenesis
    • May
    • M. Hjelm, M. Höglund, and J. Lagergren. New probabilistic network models and algorithms for oncogenesis. J Comput Biol, 13(4):853-865, May 2006.
    • (2006) J Comput Biol , vol.13 , Issue.4 , pp. 853-865
    • Hjelm, M.1    Höglund, M.2    Lagergren, J.3
  • 11
    • 18744366364 scopus 로고    scopus 로고
    • Mtreemix: A software package for learning and using mixture models of mutagenetic trees
    • N. Beerenwinkel, J. Rahnenfuhrer, R. Kaiser, D. Hoffmann, J. Selbig, and T. Lengauer. Mtreemix: a software package for learning and using mixture models of mutagenetic trees. Bioinformatics, 21(9):2106-2107, 2005.
    • (2005) Bioinformatics , vol.21 , Issue.9 , pp. 2106-2107
    • Beerenwinkel, N.1    Rahnenfuhrer, J.2    Kaiser, R.3    Hoffmann, D.4    Selbig, J.5    Lengauer, T.6
  • 12
    • 47249091226 scopus 로고    scopus 로고
    • Conjunctive bayesian networks
    • Jan
    • N. Beerenwinkel, N. Eriksson, and B. Sturmfels. Conjunctive bayesian networks. Bernoulli, 13(4):893-909, Jan 2007.
    • (2007) Bernoulli , vol.13 , Issue.4 , pp. 893-909
    • Beerenwinkel, N.1    Eriksson, N.2    Sturmfels, B.3
  • 13
    • 33747173047 scopus 로고    scopus 로고
    • Evolution on distributive lattices
    • Sep
    • N. Beerenwinkel, N. Eriksson, and B. Sturmfels. Evolution on distributive lattices. J Theor Biol, 242(2):409-20, Sep 2006.
    • (2006) J Theor Biol , vol.242 , Issue.2 , pp. 409-420
    • Beerenwinkel, N.1    Eriksson, N.2    Sturmfels, B.3
  • 14
    • 70350672603 scopus 로고    scopus 로고
    • Quantifying cancer progression with conjunctive bayesian networks
    • Nov
    • M. Gerstung, M. Baudis, H. Moch, and N. Beerenwinkel. Quantifying cancer progression with conjunctive bayesian networks. Bioinformatics, 25(21):2809-15, Nov 2009.
    • (2009) Bioinformatics , vol.25 , Issue.21 , pp. 2809-2815
    • Gerstung, M.1    Baudis, M.2    Moch, H.3    Beerenwinkel, N.4
  • 15
    • 0017465744 scopus 로고
    • Finding optimum branchings
    • R.E. Tarjan. Finding optimum branchings. Networks, 7(1):25-36, 1977.
    • (1977) Networks , vol.7 , Issue.1 , pp. 25-36
    • Tarjan, R.E.1
  • 16
    • 84981575514 scopus 로고
    • A simple derivation of edmond's algorithm for optimum branching
    • R.M. Karp. A simple derivation of edmond's algorithm for optimum branching. Networks, 1(265-272):5, 1971.
    • (1971) Networks , vol.1 , Issue.265-272 , pp. 5
    • Karp, R.M.1
  • 17
    • 84987014188 scopus 로고
    • The k best spanning arborescences of a network
    • P. Camerini, L. Fratta, and F. Maffioli. The k best spanning arborescences of a network. Networks, 10(2):91-110, 1980.
    • (1980) Networks , vol.10 , Issue.2 , pp. 91-110
    • Camerini, P.1    Fratta, L.2    Maffioli, F.3
  • 20
    • 0002629270 scopus 로고
    • Maximum likelihood from incomplete data via the em algorithm
    • A.P. Dempster, N.M. Laird, and D.B. Rubin. Maximum likelihood from incomplete data via the em algorithm. J Roy Stat Soc B, 39(1):1-38, 1977.
    • (1977) J Roy Stat Soc B , vol.39 , Issue.1 , pp. 1-38
    • Dempster, A.P.1    Laird, N.M.2    Rubin, D.B.3
  • 21
    • 0037108710 scopus 로고    scopus 로고
    • Dissecting karyotypic patterns in colorectal tumors: Two distinct but overlapping pathways in the adenoma-carcinoma transition
    • M. Höglund, D. Gisselsson, G.B. Hansen, T. Säll, F. Mitelman, and M. Nilbert. Dissecting karyotypic patterns in colorectal tumors: Two distinct but overlapping pathways in the adenoma-carcinoma transition. Canc Res, 62:5939-5946, 2002.
    • (2002) Canc Res , vol.62 , pp. 5939-5946
    • Höglund, M.1    Gisselsson, D.2    Hansen, G.B.3    Säll, T.4    Mitelman, F.5    Nilbert, M.6
  • 22
    • 4644290842 scopus 로고    scopus 로고
    • Dissecting karyotypic patterns in renal cell carcinoma: An analysis of the accumulated cytogenetic data
    • M. Höglund, D. Gisselsson, M. Soller, G.B. Hansen, P. Elfving, and F. Mitelman. Dissecting karyotypic patterns in renal cell carcinoma: an analysis of the accumulated cytogenetic data. Canc Genet Cytogenet, 153(1):1-9, 2004.
    • (2004) Canc Genet Cytogenet , vol.153 , Issue.1 , pp. 1-9
    • Höglund, M.1    Gisselsson, D.2    Soller, M.3    Hansen, G.B.4    Elfving, P.5    Mitelman, F.6


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