1. Mar 2002 (GG)1 Clustering Gene Expression Data Gene Expression Data Clustering of Genes and Conditions Methods –Agglomerative Hierarchical: Average Linkage –Centroids: K-Means –Physically motivated: Super-Paramagnetic Clustering Coupled Two-Way Clustering EMBnet: DNA Microarrays Workshop Mar. 4 – Mar. 8, 2002,UNIL & EPFL, Lausanne Gaddy Getz, Weizmann Institute, Israel

2. Mar 2002 (GG)2 Gene Expression Technologies DNA Chips (Affymetrix) and MicroArrays can measure mRNA concentration of thousands of genes simultaneously General scheme: Extract RNA, synthesize labeled cDNA, Hybridize with DNA on chip.

3. Mar 2002 (GG)3 Single Experiment After hybridization –Scan the Chip and obtain an image file –Image Analysis (find spots, measure signal and noise) Tools: ScanAlyze, Affymetrix, … Output File –Affymetrix chips: For each gene a reading proportional to the concentrations and a present/absent call. (Average Difference, Absent Call) –cDNA MicroArrays: competing hybridization of target and control. For each gene the log ratio of target and control. (CH1I-CH1B, CH2I-CH2B)

4. Mar 2002 (GG)4 Preprocessing: From one experiment to many Chip and Channel Normalization –Aim: bring readings of all experiments to be on the same scale –Cause: different RNA amounts, labeling efficiency and image acquisition parameters –Method: Multiply readings of each array/channel by a scaling factor such that: The sum of the scaled readings will be the same for all arrays Find scaling factor by a linear fit of the highly expressed genes –Note: In multi-channel experiments normalize each channel separately.

5. Mar 2002 (GG)5 Preprocessing: From one experiment to many Filtering of Genes –Remove genes that are absent in most experiments –Remove genes that are constant in all experiments –Remove genes with low readings which are not reliable.

6. Mar 2002 (GG)6 Noise and Repeats >90% 2 to 3 fold Multiplicative noise Repeat experiments Log scale dist(4,2)=dist(2,1) log – log plot

7. Mar 2002 (GG)7 We can ask many questions? Which genes are expressed differently in two known types of conditions? What is the minimal set of genes needed to distinguish one type of conditions from the others? Which genes behave similarly in the experiments? How many different types of conditions are there? Supervised Methods (use predefined labels) Unsupervised Methods (use only the data)

8. Mar 2002 (GG)8 Goal A: Find groups of genes that have correlated expression profiles. These genes are believed to belong to the same biological process and/or are co-regulated. Goal B: Divide conditions to groups with similar gene expression profiles. Example: divide drugs according to their effect on gene expression. Unsupervised Analysis Clustering Methods

9. Mar 2002 (GG)9 What is clustering?

10. Mar 2002 (GG)10 T (RESOLUTION) Cluster Analysis Yields Dendrogram

11. Mar 2002 (GG)11 What is clustering? More Mathematically Input: N data points, X i, i=1,2,…,N in a D dimensional space. Goal: Find “natural” groups or clusters. Data point of same cluster - “more similar” Tasks: –Determine number of clusters –Generate a dendrogram –Identify significant “stable” clusters

12. Mar 2002 (GG)12 Clustering is ill-posed Problem specific definitions Similarity: which points should be considered close? –Correlation coefficient –Euclidean distance Resolution: specify/hierarchical results Shape of clusters: general, spherical.

13. Mar 2002 (GG)13 Adjusting Data Adjusting

14. Mar 2002 (GG)14 Similarity Measure Similarity measure –Centered Correlation –Uncentered Correlation –Absolute correlation –Euclidean

15. Mar 2002 (GG)15 Similarity Measure Similarity measures –Centered Correlation –Uncentered Correlation –Absolute correlation –Euclidean

16. Mar 2002 (GG)16 5 24 13 Agglomerative Hierarchical Clustering 3 1 4 2 5 Distance between joined clusters Need to define the distance between the new cluster and the other clusters. Single Linkage: distance between closest pair. Complete Linkage: distance between farthest pair. Average Linkage: average distance between all pairs or distance between cluster centers Need to define the distance between the new cluster and the other clusters. Single Linkage: distance between closest pair. Complete Linkage: distance between farthest pair. Average Linkage: average distance between all pairs or distance between cluster centers Dendrogram The dendrogram induces a linear ordering of the data points

17. Mar 2002 (GG)17 Agglomerative Hierarchical Clustering Results depend on distance update method –Single Linkage: elongated clusters –Complete Linkage: sphere-like clusters Greedy iterative process NOT robust against noise No inherent measure to choose the clusters

18. Mar 2002 (GG)18 Centroid Methods - K-means Iteration = 0 Start with random position of K centroids. Iteratre until centroids are stable Assign points to centroids Move centroids to center of assign points

19. Mar 2002 (GG)19 Start with random position of K centroids. Iteratre until centroids are stable Assign points to centroids Move centroids to center of assign points Iteration = 1 Centroid Methods - K-means

20. Mar 2002 (GG)20 Start with random position of K centroids. Iteratre until centroids are stable Assign points to centroids Move centroids to center of assign points Iteration = 1 Centroid Methods - K-means

21. Mar 2002 (GG)21 Iteration = 3 Start with random position of K centroids. Iteratre until centroids are stable Assign points to centroids Move centroids to center of assign points Centroid Methods - K-means

22. Mar 2002 (GG)22 Result depends on initial centroids’ position Fast algorithm: compute distances from data points to centroids No way to choose K. Example: 3 clusters / K=2, 3, 4 Breaks long clusters Centroid Methods - K-means

23. Mar 2002 (GG)23 Super-Paramagnetic Clustering (SPC) M.Blatt, S.Weisman and E.Domany (1996) Neural Computation The idea behind SPC is based on the physical properties dilute magnets. Calculating correlation between magnet orientations at different temperatures (T). T=Low

24. Mar 2002 (GG)24 The idea behind SPC is based on the physical properties dilute magnets. Calculating correlation between magnet orientations at different temperatures (T). T=High Super-Paramagnetic Clustering (SPC) M.Blatt, S.Weisman and E.Domany (1996) Neural Computation

25. Mar 2002 (GG)25 Super-Paramagnetic Clustering (SPC) M.Blatt, S.Weisman and E.Domany (1996) Neural Computation The idea behind SPC is based on the physical properties dilute magnets. Calculating correlation between magnet orientations at different temperatures (T). T=Intermediate

26. Mar 2002 (GG)26 The algorithm simulates the magnets behavior at a range of temperatures and calculates their correlation The temperature (T) controls the resolution Example: N=4800 points in D=2 Super-Paramagnetic Clustering (SPC)

27. Mar 2002 (GG)27 Output of SPC Size of largest clusters as function of T Dendrogram Stable clusters “live” for large  T A function  (T) that peaks when stable clusters break

28. Mar 2002 (GG)28 Choosing a value for T

29. Mar 2002 (GG)29 Advantages of SPC Scans all resolutions (T) Robust against noise and initialization - calculates collective correlations. Identifies “natural” (  ) and stable clusters (  T) No need to pre-specify number of clusters Clusters can be any shape

30. Mar 2002 (GG)30 Many clustering methods applied to expression data Agglomerative Hierarchical –Average Linkage (Eisen et. al., PNAS 1998) Centroid (representative) –K-Means (Golub et. al., Science 1999) –Self Organized Maps (Tamayo et. al., PNAS 1999) Physically motivated –Deterministic Annealing (Alon et. al., PNAS 1999) –Super-Paramagnetic Clustering (Getz et. al., Physica A 2000)

31. Mar 2002 (GG)31 Available Tools Software packages: –M. Eisen’s programs for clustering and display of results (Cluster, TreeView) Predefined set of normalizations and filtering Agglomerative, K-means, 1D SOM Web sites: –Coupled Two-Way Clustering (CTWC) website http://ctwc.weizmann.ac.il both CTWC and SPC –http://ep.ebi.ac.uk/EP/EPCLUST/ General mathematical tools –MATLAB Agglomerative, public m-files. –Statistical programs (SPSS, SAS, S-plus)

32. Mar 2002 (GG)32 Back to gene expression data 2 Goals: Cluster Genes and Conditions 2 independent clustering: –Genes represented as vectors of expression in all conditions –Conditions are represented as vectors of expression of all genes

33. Mar 2002 (GG)33 1. Identify tissue classes (tumor/normal) First clustering - Experiments

34. Mar 2002 (GG)34 2. Find Differentiating And Correlated Genes Second Clustering - Genes Ribosomal proteins Cytochrome C HLA2 metabolism

35. Mar 2002 (GG)35 Two-way Clustering

36. Mar 2002 (GG)36 Coupled Two-Way Clustering (CTWC) G. Getz, E. Levine and E. Domany (2000) PNAS Motivation: Only a small subset of genes play a role in a particular biological process; the other genes introduce noise, which may mask the signal of the important players. Only a subset of the samples exhibit the expression patterns of interest. New Goal: Use subsets of genes to study subsets of samples (and vice versa) A non-trivial task – exponential number of subsets. CTWC is a heuristic to solve this problem.

37. Mar 2002 (GG)37 Football Booing Cheering

38. Mar 2002 (GG)38 CTWC of colon cancer data (A) (B)

39. Mar 2002 (GG)39 Using only the tumor tissues to cluster Genes, reveals correlation between two Gene clusters; Cell growth and epthelial COLON CANCER - ASSOCIATED WITHEPITHELIAL CELLS CTWC of colon cancer - genes

40. Mar 2002 (GG)40 Glioma cell line Low grade astrocytoma Secondary GBM Primary GBM p53 mutation S11 S12 S14 S10 S13 CTWC of Glioblastoma Data – S1(G5) Godard, Getz, Kobayashi, Nozaki, Diserens, Hamon, Stupp, Janzer, Bucher, de Tribolet, Domany & Hegi (2002) Submitted AB004904 STAT-induced STAT inhibitor 3 M32977 VEGF ANGIOGENESIS M35410 IGFBP2 X51602 VEGFR1 ANGIOGENESIS M96322 Gravin AB004903 STAT-induced STAT inhibitor 2 X52946 PTN J04111 C-JUN X79067 TIS11B AB004904 STAT-induced STAT inhibitor 3 M32977 VEGF ANGIOGENESIS M35410 IGFBP2 X51602 VEGFR1 ANGIOGENESIS M96322 Gravin AB004903 STAT-induced STAT inhibitor 2 X52946 PTN J04111 C-JUN X79067 TIS11B

41. Mar 2002 (GG)41 Biological Work Literature search for the genes Genomics: search for common regulatory signal upstream of the genes Proteomics: infer functions. Design next experiment – get more data to validate result. Find what is in common with sets of experiments/conditions.

42. Mar 2002 (GG)42 Summary Clustering methods are used to –find genes from the same biological process –group the experiments to similar conditions Different clustering methods can give different results. The physically motivated ones are more robust. Focusing on subsets of the genes and conditions can uncover structure that is masked when using all genes and conditions http://ctwc.weizmann.ac.il