TY - GEN
T1 - A computational approach to reconstructing gene regulatory networks
AU - Deng, X.
AU - Ali, H.
PY - 2003
Y1 - 2003
N2 - With the rapid accumulation of gene expression data in publicly accessible databases, computational study of gene regulation has become an obtainable goal Intrinsic to this task will be data mining tools for inferring knowledge from biological data. In this project, we have developed a new data mining technique in which we adapt the connectivity of a recurrent neural network model by indexing regulatory elements and including nonlinear interaction terms. The new technique reduces the number of parameters by O(n), therefore increasing the chance of recovering the underlying regulatory network. In order to fit the model from data, we have developed a genetic fitting algorithm with O(n) time complexity and that adapts the connectivity during the fitting process until a satisfactory fit is obtained. We have implemented this fitting algorithm and applied it to two data sets: rat central nervous system development (CNS) data with 112 genes, and yeast whole genome data with 2467 genes. With multiple runs of the fitting algorithm, we were able to efficiently generate a statistical pattern of the model parameters from the data. Because of its adaptive features, this method will be especially useful for reconstructing coarse-grained gene regulatory network from large scale or genome scale gene expression data sets.
AB - With the rapid accumulation of gene expression data in publicly accessible databases, computational study of gene regulation has become an obtainable goal Intrinsic to this task will be data mining tools for inferring knowledge from biological data. In this project, we have developed a new data mining technique in which we adapt the connectivity of a recurrent neural network model by indexing regulatory elements and including nonlinear interaction terms. The new technique reduces the number of parameters by O(n), therefore increasing the chance of recovering the underlying regulatory network. In order to fit the model from data, we have developed a genetic fitting algorithm with O(n) time complexity and that adapts the connectivity during the fitting process until a satisfactory fit is obtained. We have implemented this fitting algorithm and applied it to two data sets: rat central nervous system development (CNS) data with 112 genes, and yeast whole genome data with 2467 genes. With multiple runs of the fitting algorithm, we were able to efficiently generate a statistical pattern of the model parameters from the data. Because of its adaptive features, this method will be especially useful for reconstructing coarse-grained gene regulatory network from large scale or genome scale gene expression data sets.
UR - http://www.scopus.com/inward/record.url?scp=84960377311&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84960377311&partnerID=8YFLogxK
U2 - 10.1109/CSB.2003.1227350
DO - 10.1109/CSB.2003.1227350
M3 - Conference contribution
AN - SCOPUS:84960377311
T3 - Proceedings of the 2003 IEEE Bioinformatics Conference, CSB 2003
SP - 413
EP - 414
BT - Proceedings of the 2003 IEEE Bioinformatics Conference, CSB 2003
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2nd International IEEE Computer Society Computational Systems Bioinformatics Conference, CSB 2003
Y2 - 11 August 2003 through 14 August 2003
ER -