Link to the University of Pittsburgh Homepage
Link to the University Library System Homepage Link to the Contact Us Form

An integer optimization algorithm for robust identification of non-linear gene regulatory networks

UNSPECIFIED (2012) An integer optimization algorithm for robust identification of non-linear gene regulatory networks. BMC Systems Biology, 6.

[img]
Preview
PDF
Published Version
Available under License : See the attached license file.

Download (1MB) | Preview
[img] Plain Text (licence)
Available under License : See the attached license file.

Download (1kB)

Abstract

Background: Reverse engineering gene networks and identifying regulatory interactions are integral to understanding cellular decision making processes. Advancement in high throughput experimental techniques has initiated innovative data driven analysis of gene regulatory networks. However, inherent noise associated with biological systems requires numerous experimental replicates for reliable conclusions. Furthermore, evidence of robust algorithms directly exploiting basic biological traits are few. Such algorithms are expected to be efficient in their performance and robust in their prediction.Results: We have developed a network identification algorithm to accurately infer both the topology and strength of regulatory interactions from time series gene expression data in the presence of significant experimental noise and non-linear behavior. In this novel formulism, we have addressed data variability in biological systems by integrating network identification with the bootstrap resampling technique, hence predicting robust interactions from limited experimental replicates subjected to noise. Furthermore, we have incorporated non-linearity in gene dynamics using the S-system formulation. The basic network identification formulation exploits the trait of sparsity of biological interactions. Towards that, the identification algorithm is formulated as an integer-programming problem by introducing binary variables for each network component. The objective function is targeted to minimize the network connections subjected to the constraint of maximal agreement between the experimental and predicted gene dynamics. The developed algorithm is validated using both in silico and experimental data-sets. These studies show that the algorithm can accurately predict the topology and connection strength of the in silico networks, as quantified by high precision and recall, and small discrepancy between the actual and predicted kinetic parameters. Furthermore, in both the in silico and experimental case studies, the predicted gene expression profiles are in very close agreement with the dynamics of the input data.Conclusions: Our integer programming algorithm effectively utilizes bootstrapping to identify robust gene regulatory networks from noisy, non-linear time-series gene expression data. With significant noise and non-linearities being inherent to biological systems, the present formulism, with the incorporation of network sparsity, is extremely relevant to gene regulatory networks, and while the formulation has been validated against in silico and E. Coli data, it can be applied to any biological system. © 2012 Chemmangattuvalappil et al.; licensee BioMed Central Ltd.


Share

Citation/Export:
Social Networking:
Share |

Details

Item Type: Article
Status: Published
Date: 2 September 2012
Date Type: Publication
Journal or Publication Title: BMC Systems Biology
Volume: 6
DOI or Unique Handle: 10.1186/1752-0509-6-119
Schools and Programs: Swanson School of Engineering > Chemical Engineering
Refereed: Yes
Date Deposited: 29 Nov 2016 21:07
Last Modified: 05 Jan 2019 15:55
URI: http://d-scholarship.pitt.edu/id/eprint/29842

Metrics

Monthly Views for the past 3 years

Plum Analytics

Altmetric.com


Actions (login required)

View Item View Item