SampleClassification - Revision history

Owen: /* Interaction based Tree Building */

2011-04-04T11:18:40Z

Interaction based Tree Building

← Older revision		Revision as of 20:18, 4 April 2011
Line 100:		Line 100:
	*Methods:		*Methods:
	Michiel provided the results of his MASA and MARA analysis on the FANTOM5 snapshot data. We simply used this to construct networks in the same way that was carried out in the FANTOM4 nature genetics paper (fig 4). Once these were constructed (they can be viewed here further guidance usage will follow) we simply created binary string in the sample way as above but where the presence absence was for edges in the TF-TF network. RAxML was then used again and the consensus tree can be seen here: [[Media:edge_net_consensus.pdf]]		Michiel provided the results of his MASA and MARA analysis on the FANTOM5 snapshot data. We simply used this to construct networks in the same way that was carried out in the FANTOM4 nature genetics paper (fig 4). Once these were constructed (they can be viewed here further guidance usage will follow) we simply created binary string in the sample way as above but where the presence absence was for edges in the TF-TF network. RAxML was then used again and the consensus tree can be seen here: [[Media:edge_net_consensus.pdf]]
			If you wish to look at a complete clustering the best tree (ie the one that was most likely according the the ML algorithm) can be seen here: [[Media:BestTree_edgenet.pdf]]

	*Results:		*Results:

Owen: /* Interaction based Tree Building */

2011-04-04T11:05:45Z

Interaction based Tree Building

← Older revision		Revision as of 20:05, 4 April 2011
Line 99:		Line 99:

	*Methods:		*Methods:
	Michiel provided the results of his MASA and MARA analysis on the FANTOM5 snapshot data. We simply used this to construct networks in the same way that was carried out in the FANTOM4 nature genetics paper (fig 4). Once these were constructed (they can be viewed here further guidance usage will follow) we simply created binary string in the sample way as above but where the presence absence was for edges in the TF-TF network. RAxML was then used again and the consensus tree can be seen here: ~~(MEDIA HERE)~~		Michiel provided the results of his MASA and MARA analysis on the FANTOM5 snapshot data. We simply used this to construct networks in the same way that was carried out in the FANTOM4 nature genetics paper (fig 4). Once these were constructed (they can be viewed here further guidance usage will follow) we simply created binary string in the sample way as above but where the presence absence was for edges in the TF-TF network. RAxML was then used again and the consensus tree can be seen here: [[Media:edge_net_consensus.pdf]]


	*Results:		*Results:

Owen: /* Binary Gene Expression Tree Building */

2011-04-04T11:05:10Z

Binary Gene Expression Tree Building

← Older revision		Revision as of 20:05, 4 April 2011
Line 84:		Line 84:
	.		.

	We used RAxML which a widely used maximum likelihood software tool for creating trees. A decription of how it works can be found in this paper: (http://bioinformatics.oxfordjournals.org/content/22/21/2688.short). Since this process is stochastic the resulting trees from separate runs is not always the same. We can utilize the concept of consensus trees and bootstrapping to estimate the most likely tree and to get an idea of which samples always cluster together and which are rarely members of the same cluster. This is the tree provided here: ~~(MEDIA HERE)~~		We used RAxML which a widely used maximum likelihood software tool for creating trees. A decription of how it works can be found in this paper: (http://bioinformatics.oxfordjournals.org/content/22/21/2688.short). Since this process is stochastic the resulting trees from separate runs is not always the same. We can utilize the concept of consensus trees and bootstrapping to estimate the most likely tree and to get an idea of which samples always cluster together and which are rarely members of the same cluster. This is the tree provided here: [[Media:tree.pdf]]

Owen: /* Binary Gene Expression Tree Building */

2011-04-04T10:59:25Z

Binary Gene Expression Tree Building

← Older revision		Revision as of 19:59, 4 April 2011
Line 76:		Line 76:

	*Methods:		*Methods:
	Using the data in the gene expression table provided on the wiki (~~URL HERE~~) we thresholded the gene expression of each gene at TPM. Those with an expression of 2 TPM or less we given a 0 and those a above a 1. So for each sample we had a string that described the gene presence/absence:		Using the data in the gene expression table provided on the wiki (https://fantom5-collaboration.gsc.riken.jp/files/data/shared/contrib/110120-gene_expression_table-WP4/UPDATE_010/) we thresholded the gene expression of each gene at TPM. Those with an expression of 2 TPM or less we given a 0 and those a above a 1. So for each sample we had a string that described the gene presence/absence:
	Eg		Eg
	Brain_sample_1 0010101101110001		Brain_sample_1 0010101101110001
Line 90:		Line 90:
	*Results:		*Results:
	This tree contains some of the characteristics that we have seen in other trees, for instance the brain and macrophage samples clusters together robustly. However there is no separation of cell lines and primary cells that has been shown in other trees on the mailing list.		This tree contains some of the characteristics that we have seen in other trees, for instance the brain and macrophage samples clusters together robustly. However there is no separation of cell lines and primary cells that has been shown in other trees on the mailing list.
	The samples that do not cluster at all using this method are probably worth investigating in the other methods since you would expect that simply by looking at the genes that are being expressed you would get some robust similarities to other samples.		The samples that do not cluster at all using this method are probably worth investigating in the other methods since you would expect that simply by looking at the genes that are being expressed you would get some robust similarities to other samples.

	== Interaction based Tree Building ==		== Interaction based Tree Building ==

Owen at 10:55, 4 April 2011

2011-04-04T10:55:56Z

← Older revision		Revision as of 19:55, 4 April 2011
Line 66:		Line 66:

	Why domain-centric expression? What I can come up with are: Domain-centric expression info may be another important measure of increasing phenotypic diversity: direct basis of interacting protein networks (which are considered to be molecular carriers of phenotype information).		Why domain-centric expression? What I can come up with are: Domain-centric expression info may be another important measure of increasing phenotypic diversity: direct basis of interacting protein networks (which are considered to be molecular carriers of phenotype information).


			== Binary Gene Expression Tree Building ==

			*Motivations:

			We were interested to see what the data could tell us if we ignored the gene expression levels and simply looked at which genes were being expressed. It was our intention to follow this with the presence/absence of regulatory interactions and this allowed to see the additional information that we could extract from doing this.


			*Methods:
			Using the data in the gene expression table provided on the wiki (URL HERE) we thresholded the gene expression of each gene at TPM. Those with an expression of 2 TPM or less we given a 0 and those a above a 1. So for each sample we had a string that described the gene presence/absence:
			Eg
			Brain_sample_1 0010101101110001
			Liver_sampple_1 1010001010101110
			.
			.
			.

			We used RAxML which a widely used maximum likelihood software tool for creating trees. A decription of how it works can be found in this paper: (http://bioinformatics.oxfordjournals.org/content/22/21/2688.short). Since this process is stochastic the resulting trees from separate runs is not always the same. We can utilize the concept of consensus trees and bootstrapping to estimate the most likely tree and to get an idea of which samples always cluster together and which are rarely members of the same cluster. This is the tree provided here: (MEDIA HERE)



			*Results:
			This tree contains some of the characteristics that we have seen in other trees, for instance the brain and macrophage samples clusters together robustly. However there is no separation of cell lines and primary cells that has been shown in other trees on the mailing list.
			The samples that do not cluster at all using this method are probably worth investigating in the other methods since you would expect that simply by looking at the genes that are being expressed you would get some robust similarities to other samples.

			== Interaction based Tree Building ==

			*Motivations:
			We wanted to see if we could cluster the data simply based on the interactions that were present based on the Motif activity work that Michiel had done. It is our intention to use the idea of network motifs to explore this further since there have been a number of success stories about small network motif distinguishing tissue type in the literature. In the early stages of this investigation we have simply been looking at the presence/absence of interactions (or in terms of motif interactions involving two nodes) but we intend to extend this two triangles (3 nodes) and squares (4 nodes).


			*Methods:
			Michiel provided the results of his MASA and MARA analysis on the FANTOM5 snapshot data. We simply used this to construct networks in the same way that was carried out in the FANTOM4 nature genetics paper (fig 4). Once these were constructed (they can be viewed here further guidance usage will follow) we simply created binary string in the sample way as above but where the presence absence was for edges in the TF-TF network. RAxML was then used again and the consensus tree can be seen here: (MEDIA HERE)


			*Results:
			Similar to above this tree contains sections that make sense (eg Brain, Epithelial, macrophage clusters) but also contains areas that are not well defined or don’t seem to make sense.
			It is our hop that by extending this work we can identify not only important tissue specific genes but tissue specific regulatory programs that we can use to help our efforts to identifying genes to use in reprogramming experiments.

Hai Fang: /* Cross-species sample classifications based on structural domain-ome expression information */

2011-04-01T11:58:56Z

Cross-species sample classifications based on structural domain-ome expression information

← Older revision		Revision as of 20:58, 1 April 2011
Line 48:		Line 48:
	Using CAGE data from FANTOM 5, extract CTSS (Cage Tag Start Sits) of known Refgenes, and then map to ENSENBL proteins and SUPERFAMILY domain assignments at SCOP superfamily levels, resulting in domain-sample expression matrix. In this matrix, each entry measures average expression level per domain, which is calculated following: SUM(tags for a refgene X number of domains in this refgene) divided by total number of domains. This calculation can account for the domain copy numbers in different genomes, important for comparative study.		Using CAGE data from FANTOM 5, extract CTSS (Cage Tag Start Sits) of known Refgenes, and then map to ENSENBL proteins and SUPERFAMILY domain assignments at SCOP superfamily levels, resulting in domain-sample expression matrix. In this matrix, each entry measures average expression level per domain, which is calculated following: SUM(tags for a refgene X number of domains in this refgene) divided by total number of domains. This calculation can account for the domain copy numbers in different genomes, important for comparative study.

	In order to make sure the data follows the normal distribution and correct the systematic biases introduced during the conversion from gene-level to domain level ~~and~~, the domain-sample expression matrix ~~should~~ be first log-transformed, and then standardized in a column/sample-wise manner so that the median is 0 and variation equals 1.		In order to make sure the data follows the normal distribution and correct the systematic biases introduced during the conversion from gene-level to domain level, the domain-sample expression matrix can be first log-transformed, and then standardized in a column/sample-wise manner so that the median of each column is 0 and variation equals 1.

	Using this transformed and standardized domain-level expression matrix, we apply conventional hierarchical algorithm for sample classifications (Euclidean distance as similarity metric, average linkage clustering method). See the result [[Media:Hierarchical_tree.pdf]], and its correlation matrix [[Media:correlation_matrix.pdf]].		Using this transformed and standardized domain-level expression matrix, we apply conventional hierarchical algorithm for sample classifications (Euclidean distance as similarity metric, average linkage clustering method). See the result [[Media:Hierarchical_tree.pdf]], and its correlation matrix [[Media:correlation_matrix.pdf]].

Hai Fang: /* Cross-species sample classifications based on structural domain-ome expression information */

2011-03-31T20:49:40Z

Cross-species sample classifications based on structural domain-ome expression information

← Older revision		Revision as of 05:49, 1 April 2011
Line 42:		Line 42:
	For a given organism, domain-ome is a whole collection of SCOP domains existing. From the evo-dev point of view, present-absent binary pattern of domain-ome is shaped by evolution, and numeric expression pattern of domain-ome can be reflective of tissue origins and cell types. Intuitively, it would be very interesting to see whether we can perform inter-species/intra-species comparative analysis based on domain-ome expression.		For a given organism, domain-ome is a whole collection of SCOP domains existing. From the evo-dev point of view, present-absent binary pattern of domain-ome is shaped by evolution, and numeric expression pattern of domain-ome can be reflective of tissue origins and cell types. Intuitively, it would be very interesting to see whether we can perform inter-species/intra-species comparative analysis based on domain-ome expression.

	Ideally, we need protein-level expression data and protein-domain mapping matrix to generate domain-level expression data. Practically, domain-ome expression for a panel of tissues and cell types across different species can be converted from CAGE data in FANTOM 5 or other microarray-based high-~~through~~ data in public-access sources.		Ideally, we need protein-level expression data and protein-domain mapping matrix to generate domain-level expression data. Practically, domain-ome expression for a panel of tissues and cell types across different species can be converted from CAGE data in FANTOM 5 or other microarray-based high-throughput data in public-access sources.

	*Methods and Results:		*Methods and Results:

Hai Fang at 20:28, 31 March 2011

2011-03-31T20:28:11Z

← Older revision		Revision as of 05:28, 1 April 2011
Line 50:		Line 50:
	In order to make sure the data follows the normal distribution and correct the systematic biases introduced during the conversion from gene-level to domain level and, the domain-sample expression matrix should be first log-transformed, and then standardized in a column/sample-wise manner so that the median is 0 and variation equals 1.		In order to make sure the data follows the normal distribution and correct the systematic biases introduced during the conversion from gene-level to domain level and, the domain-sample expression matrix should be first log-transformed, and then standardized in a column/sample-wise manner so that the median is 0 and variation equals 1.

	Using this transformed and standardized domain-level expression matrix, we apply conventional hierarchical algorithm for sample classifications (Euclidean distance as similarity metric, average linkage clustering method). See the result [[Media:Hierarchical_tree.pdf]], and its correlation matrix correlation_matrix.pdf.		Using this transformed and standardized domain-level expression matrix, we apply conventional hierarchical algorithm for sample classifications (Euclidean distance as similarity metric, average linkage clustering method). See the result [[Media:Hierarchical_tree.pdf]], and its correlation matrix [[Media:correlation_matrix.pdf]].

	From these figures, several features stand out:		From these figures, several features stand out:
Line 60:		Line 60:
	</p>		</p>
	<p>		<p>
	3. If looking into greater details for those samples belonging to the same types within the same species, the similar quality can be comparatively achieved using gene-level expression data (under the same parameter for sample classifications: ~~genes X samples from human_tissue,primary_cell,cell_lines~~.pdf).		3. If looking into greater details for those samples belonging to the same types within the same species, the similar quality can be comparatively achieved using gene-level expression data (under the same parameter for sample classifications: [[Media:Hierarchical_tree_gene.pdf]]).
	</p>		</p>

	Also, we apply projection techniques (see Sammon_projection.pdf and SOM_projection.pdf) to capture their relationships. Clearly, the relationships revealed above are independent of algorithms used.		Also, we apply projection techniques (see [[Media:Sammon_projection.pdf]] and [[Media:SOM_projection.pdf]]) to capture their relationships. Clearly, the relationships revealed above are independent of algorithms used.

	Why domain-centric expression? What I can come up with are: Domain-centric expression info may be another important measure of increasing phenotypic diversity: direct basis of interacting protein networks (which are considered to be molecular carriers of phenotype information).		Why domain-centric expression? What I can come up with are: Domain-centric expression info may be another important measure of increasing phenotypic diversity: direct basis of interacting protein networks (which are considered to be molecular carriers of phenotype information).

Hai Fang at 20:25, 31 March 2011

2011-03-31T20:25:46Z

← Older revision		Revision as of 05:25, 1 April 2011
Line 50:		Line 50:
	In order to make sure the data follows the normal distribution and correct the systematic biases introduced during the conversion from gene-level to domain level and, the domain-sample expression matrix should be first log-transformed, and then standardized in a column/sample-wise manner so that the median is 0 and variation equals 1.		In order to make sure the data follows the normal distribution and correct the systematic biases introduced during the conversion from gene-level to domain level and, the domain-sample expression matrix should be first log-transformed, and then standardized in a column/sample-wise manner so that the median is 0 and variation equals 1.

	Using this transformed and standardized domain-level expression matrix, we apply conventional hierarchical algorithm for sample classifications (Euclidean distance as similarity metric, average linkage clustering method). See the result [[~~File~~:Hierarchical_tree.pdf]], and its correlation matrix correlation_matrix.pdf.		Using this transformed and standardized domain-level expression matrix, we apply conventional hierarchical algorithm for sample classifications (Euclidean distance as similarity metric, average linkage clustering method). See the result [[Media:Hierarchical_tree.pdf]], and its correlation matrix correlation_matrix.pdf.

	From these figures, several features stand out:		From these figures, several features stand out:

Hai Fang at 20:14, 31 March 2011

2011-03-31T20:14:19Z

← Older revision		Revision as of 05:14, 1 April 2011
Line 50:		Line 50:
	In order to make sure the data follows the normal distribution and correct the systematic biases introduced during the conversion from gene-level to domain level and, the domain-sample expression matrix should be first log-transformed, and then standardized in a column/sample-wise manner so that the median is 0 and variation equals 1.		In order to make sure the data follows the normal distribution and correct the systematic biases introduced during the conversion from gene-level to domain level and, the domain-sample expression matrix should be first log-transformed, and then standardized in a column/sample-wise manner so that the median is 0 and variation equals 1.

	Using this transformed and standardized domain-level expression matrix, we apply conventional hierarchical algorithm for sample classifications (Euclidean distance as similarity metric, average linkage clustering method). See the result Hierarchical_tree.pdf, and its correlation matrix correlation_matrix.pdf.		Using this transformed and standardized domain-level expression matrix, we apply conventional hierarchical algorithm for sample classifications (Euclidean distance as similarity metric, average linkage clustering method). See the result [[File:Hierarchical_tree.pdf]], and its correlation matrix correlation_matrix.pdf.

	From these figures, several features stand out:		From these figures, several features stand out: