×

Identifying local co-regulation relationships in gene expression data. (English) Zbl 1343.92169

Summary: Identifying interesting relationships between pairs of genes, presented over some of experimental conditions in gene expression data set, is useful for discovering novel functional gene interactions. In this paper, we introduce a new method for identifying local co-regulation relationships (IdLCR). These local relationships describe the behaviors of pairwise genes, which are either up- or down-regulated throughout the identified condition subset. IdLCR firstly detects the pairwise gene-gene relationships taking functional forms and the condition subsets by using a regression spline model. Then it measures the relationships using a penalized Pearson correlation and ranks the responding gene pairs by their scores. By this way, those relationships without clearly biological interpretations can be filtered out and the local co-regulation relationships can be obtained. In the simulation data sets, ten different functional relationships are embedded. Applying IdLCR to these data sets, the results show its ability to identify functional relationships and the condition subsets. For micro-array and RNA-seq gene expression data, IdLCR can identify novel biological relationships which are different from those uncovered by IFGR and MINE.

MSC:

92C40 Biochemistry, molecular biology
92B10 Taxonomy, cladistics, statistics in mathematical biology
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Bhattacharya, A.; De, R., Bi-correlation clustering algorithm for determining a set of co-regulated genes, Bioinformatics, 25, 2795-2801 (2009)
[6] Gan, X.; Liew, A.; Yan, H., Discovering biclusters in gene expression data based on high-dimensional linear geometries, BMC Bioinformatics, 9, 209 (2008)
[7] Gao, Q.; Ho, C.; Jia, Y.; Li, J.; Huang, H., Biclustering of linear patterns in gene expression data, J. Comput. Biol., 19, 619-631 (2012)
[8] Getz, G.; Levine, E.; Domany, E., Coupled two-way clustering analysis of gene microarray data, Proc. Natl. Acad. Sci., 97, 12079-12084 (2000)
[9] Hartigan, J., Clustering Algorithms (1975), John Wiley and Sons, Inc.: John Wiley and Sons, Inc. New York, NY, USA · Zbl 0372.62040
[10] Hochreiter, S.; Bodenhofer, U.; Heusel, M., Fabiafactor analysis for bicluster acquisition, Bioinformatics, 26, 1520-1527 (2010)
[11] Huang, D.; Sherman, B.; Lempicki, R., Bioinformatics enrichment toolspaths toward the comprehensive functional analysis of large gene lists, Nucleic Acids Res., 37, 1-13 (2009)
[12] Klugar, Y.; Basri, R.; Chang, J., Spectral biclustering or microarray datacoclustering genes and conditions, Genome Res., 13, 703-716 (2003)
[13] Langmead, B.; Hansen, K. D.; Leek, J. T., Cloud-scale rna-sequencing differential expression analysis with myrna, Genome Biol., 11 (2010)
[14] Lazzeroni, L.; Owen, A., Plaid models for gene expression data, Stat. Sin., 12, 61-86 (2002) · Zbl 1004.62084
[15] Mosca, E.; Bertoli, G.; Piscitelli, E.; Vilardo, L.; Reinbold, R. A.; Zucchi, I.; Milanesi, L., Identification of functionally related genes using data mining and data integrationa breast cancer case study, BMC Bioinform., 10, Suppl. 12 (2009)
[16] Nepomuceno, J.; Troncoso, A.; Aguilar-Ruiz, J., Biclustering of gene expression data by correlation-based scatter search, BioData Mining, 4, 3 (2011)
[17] Reshef, D. N.; Reshef, Y. A.; Finucane, H. K.; Grossman, S. R.; McVean, G.; Turnbaugh, P. J.; Lander, E. S.; Mitzenmacher, M.; Sabeti, P. C., Detecting novel associations in large data sets, Science, 334, 1518-1524 (2011) · Zbl 1359.62216
[19] Sheng, Q.; Moreau, Y.; Moor, B., Biclustering microarray data by gibbs sampling, Bioinformatics, 19, ii196-ii205 (2003)
[23] Zhao, H.; Liew, A.; Xie, X.; Yan, H., A new geometric biclustering algorithm based on the Hough transform for analysis of large-scale microarray data, J. Theor. Biol., 251, 264-274 (2008) · Zbl 1398.92087
[24] Zheng, Q.; Wang, X.-J., Goeasta web-based software toolkit for gene ontology enrichment analysis, Nucleic Acids Res., 36, W358-W363 (2008)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.