12
The Ping-Pong Algorithm Kutalik, Beckmann, Bergmann NBT 08 Some slides from Sven Bergmann http://serverdgm.unil.ch/bergmann ABDBM © Ron Shamir

The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

  • Upload
    others

  • View
    6

  • Download
    0

Embed Size (px)

Citation preview

Page 1: The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

The Ping-Pong Algorithm

Kutalik, Beckmann, Bergmann NBT 08

Some slides from Sven Bergmann http://serverdgm.unil.ch/bergmann

ABDBM © Ron Shamir

Page 2: The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

The NCI-60 drug response and GE db Scherf et al. Nat Gen 00

ABDBM © Ron Shamir

R E Rij:

Response of cell line j to drug i

Eij: Exp of gene i in

untreated cell line j

Page 3: The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

Clustering the cell lines

ABDBM © Ron Shamir

Based on E

Based on R

Very different pictures. Can we reconciliate?

Page 4: The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

Approaches • ISA(E) : get transcription modules. Ignores R. • ISA (E·RT) : compute drug-gene correlation across

the cell lines, generate drug-gene modules by compiling info across all cell lines. Misses signals on few cell lines

• ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {(di,ci)} in D and {(gi,c*i)}. Select highly correlated module pairs: corr(ci,c*j)>α “late integration”

• Cluster (E·RT) : Clusters the genes using HC, Set cutoff to get desired no. of clusters. Cluster the drugs too. Match gene and drug clusters by mean bic signal. “late integration”

• … ABDBM © Ron Shamir

Page 5: The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

Generalizing ISA

Co-modules Gene-modules Drug-modules

C3

F4

C4

F3

G3

G4

[AGF]

[AGF]

[BFC]

[BFC]

C5 D3

F6

C6 D4

F5

[BFC]

[BFC]

[CDF]

[CDF]

C1 D1

F2

C2 D2

F1

G1

G2

[AGF] [CDF] [BFC]

[AGF] [CDF] [BFC]

ABDBM © Ron Shamir

Page 6: The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

ABDBM © Ron Shamir

Page 7: The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

G

D

C

G4

D4

C3 C4

Drug-modules

Gene-modules

C5 C6

Modules and Co-modules

D3

G3

Co-modules

G2

G1

C1 C2

D1

D2

ABDBM © Ron Shamir

Page 8: The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

E C G R D MED

Iteratively refine genes, cell-lines and drugs to get co-modules

The Ping-Pong algorithm!

1

2

3

4

ABDBM © Ron Shamir

Page 9: The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

Results on NCI-60 (859 m

odules) ABDBM © Ron Shamir

Page 10: The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

Co-modules have predictive power for drug-gene associations

ABDBM © Ron Shamir

Page 11: The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

Co-modules analysis provides biological focus through data integration

ABDBM © Ron Shamir

Dots: GO BP categories. X: ISA module

score. Y: PPA score

Page 12: The Ping-Pong Algorithm - TAUrshamir/abdbm/pres/17/PingPong.pdf · •ISA(E)&ISA(T): Suppose modules are represented as row/col weights. Get modules {( di,ci)} in D and {(gi,c*i)}

• Analysis of large-scale expression data bears great potential to understand global transcription programs and their evolution

• Innovative analysis tools needed to extract information from such data

• ISA & Ping-Pong Algorithms: – decomposes data into “transcription

modules” – integrates external information – allows for interspecies comparative analysis

Sven’s Take-home Messages

ABDBM © Ron Shamir