Download The Door into Summer

Yongjin Park,
Stanley Shackney,
and Russell Schwartz
2008.10.21 Accepted
Computational Biology and Bioinformatics
Overview
Introduction
 Method

 Uncorrected method
 Optimization method
 Sampling method
 Modular method

Result
Introduction
Methods
Uncorrected method
 Optimization method
 Sampling method
 Modular method

Uncorrected method
Without any network-based correction
 minimum spanning tree (MST) problem

Optimization method

regression equations’ form

Solving the following quadratic
programming problem
Sampling method

Posterior probability of possible structures
using Markov Chain Monte Carlo (MCMC)
method
Sampling method(Cont.)
posterior probability of features can be
estimated by
Metropolis-Hastings algo.
 the expression


likelihood
Modular method
Dirichlet process mixture
 I∗−1 genes to K∗ modules
 probability of I∗-th gene belonging to one of
the K∗ currently known modules


the I∗-th gene could be the first member of
a newly generated K∗ +1-th module
Result

Data set
 Lung Cancer
○ Normal cell
○ Adenocarcinoma
○ Small cell
○ Large cell neuroendocrine carcinoid
○ Large cell

Z score
 uncorrected = −7.5
 optimization = −10.6
 modular = −10.4
 sampling = −11.7

False Negative