1. Inference of scale-free networks from gene expression time series
- Author
-
Tominaga Daisuke and Paul Horton
- Subjects
Computational model ,Time Factors ,Proteome ,Computer science ,Gene Expression Profiling ,Scale-free network ,Gene regulatory network ,Inference ,Gene Expression ,computer.software_genre ,Biochemistry ,Models, Biological ,Computer Science Applications ,Cell Physiological Phenomena ,Genetic algorithm ,Computer Simulation ,Data mining ,Time series ,Molecular Biology ,computer ,Biological network ,Algorithms ,Network model ,Signal Transduction - Abstract
Quantitative time-series observation of gene expression is becoming possible, for example by cell array technology. However, there are no practical methods with which to infer network structures using only observed time-series data. As most computational models of biological networks for continuous time-series data have a high degree of freedom, it is almost impossible to infer the correct structures. On the other hand, it has been reported that some kinds of biological networks, such as gene networks and metabolic pathways, may have scale-free properties. We hypothesize that the architecture of inferred biological network models can be restricted to scale-free networks. We developed an inference algorithm for biological networks using only time-series data by introducing such a restriction. We adopt the S-system as the network model, and a distributed genetic algorithm to optimize models to fit its simulated results to observed time series data. We have tested our algorithm on a case study (simulated data). We compared optimization under no restriction, which allows for a fully connected network, and under the restriction that the total number of links must equal that expected from a scale free network. The restriction reduced both false positive and false negative estimation of the links and also the differences between model simulation and the given time-series data.
- Published
- 2005