Gene Expression Complex Networks: Synthesis, Identification, and Analysis

Author(s)

Lopes, Fabricio M. ^{[1, 2]} ; Cesar, Jr., Roberto M. ^[1] ; Costa, Luciano Da F. ^[3]

Affiliation

^[1] Univ Sao Paulo, Inst Math & Stat, BR-05508 Sao Paulo - Brazil

^[2] Univ Tecnol Fed Parana, Maringa, Parana - Brazil

^[3] Univ Sao Paulo, Phys Inst Sao Carlos, BR-05508 Sao Paulo - Brazil

• Document type: Journal article
• Source: JOURNAL OF COMPUTATIONAL BIOLOGY; v. 18, n. 10, p. 1353-1367, OCT 2011.
• Web of Science Citations: 20

Abstract

Thanks to recent advances in molecular biology, allied to an ever increasing amount of experimental data, the functional state of thousands of genes can now be extracted simultaneously by using methods such as cDNA microarrays and RNA-Seq. Particularly important related investigations are the modeling and identification of gene regulatory networks from expression data sets. Such a knowledge is fundamental for many applications, such as disease treatment, therapeutic intervention strategies and drugs design, as well as for planning high-throughput new experiments. Methods have been developed for gene networks modeling and identification from expression profiles. However, an important open problem regards how to validate such approaches and its results. This work presents an objective approach for validation of gene network modeling and identification which comprises the following three main aspects: (1) Artificial Gene Networks (AGNs) model generation through theoretical models of complex networks, which is used to simulate temporal expression data; (2) a computational method for gene network identification from the simulated data, which is founded on a feature selection approach where a target gene is fixed and the expression profile is observed for all other genes in order to identify a relevant subset of predictors; and (3) validation of the identified AGN-based network through comparison with the original network. The proposed framework allows several types of AGNs to be generated and used in order to simulate temporal expression data. The results of the network identification method can then be compared to the original network in order to estimate its properties and accuracy. Some of the most important theoretical models of complex networks have been assessed: the uniformly-random Erdos-Renyi (ER), the small-world Watts-Strogatz (WS), the scale-free Barabasi-Albert (BA), and geographical networks (GG). The experimental results indicate that the inference method was sensitive to average degree k variation, decreasing its network recovery rate with the increase of k. The signal size was important for the inference method to get better accuracy in the network identification rate, presenting very good results with small expression profiles. However, the adopted inference method was not sensible to recognize distinct structures of interaction among genes, presenting a similar behavior when applied to different network topologies. In summary, the proposed framework, though simple, was adequate for the validation of the inferred networks by identifying some properties of the evaluated method, which can be extended to other inference methods. (AU)

• FAPESP's process: 05/00587-5 - Mesh (graph) modeling and techniques of pattern recognition: structure, dynamics and applications
• Grantee: Roberto Marcondes Cesar Junior
• Support Opportunities: Research Projects - Thematic Grants