Statements in which the resource exists as a subject.
PredicateObject
rdf:type
lifeskim:mentions
pubmed:issue
2
pubmed:dateCreated
2005-7-12
pubmed:abstractText
Reverse-engineering of gene networks using linear models often results in an underdetermined system because of excessive unknown parameters. In addition, the practical utility of linear models has remained unclear. We address these problems by developing an improved method, EXpression Array MINing Engine (EXAMINE), to infer gene regulatory networks from time-series gene expression data sets. EXAMINE takes advantage of sparse graph theory to overcome the excessive-parameter problem with an adaptive-connectivity model and fitting algorithm. EXAMINE also guarantees that the most parsimonious network structure will be found with its incremental adaptive fitting process. Compared to previous linear models, where a fully connected model is used, EXAMINE reduces the number of parameters by O(N), thereby increasing the chance of recovering the underlying regulatory network. The fitting algorithm increments the connectivity during the fitting process until a satisfactory fit is obtained. We performed a systematic study to explore the data mining ability of linear models. A guideline for using linear models is provided: If the system is small (3-20 elements), more than 90% of the regulation pathways can be determined correctly. For a large-scale system, either clustering is needed or it is necessary to integrate information in addition to expression profile. Coupled with the clustering method, we applied EXAMINE to rat central nervous system development (CNS) data with 112 genes. We were able to efficiently generate regulatory networks with statistically significant pathways that have been predicted previously.
pubmed:grant
pubmed:language
eng
pubmed:journal
pubmed:citationSubset
IM
pubmed:chemical
pubmed:status
MEDLINE
pubmed:month
Aug
pubmed:issn
0303-2647
pubmed:author
pubmed:issnType
Print
pubmed:volume
81
pubmed:owner
NLM
pubmed:authorsComplete
Y
pubmed:pagination
125-36
pubmed:dateRevised
2007-11-14
pubmed:meshHeading
pubmed-meshheading:15951103-Algorithms, pubmed-meshheading:15951103-Animals, pubmed-meshheading:15951103-Central Nervous System, pubmed-meshheading:15951103-Cluster Analysis, pubmed-meshheading:15951103-Computational Biology, pubmed-meshheading:15951103-Computer Simulation, pubmed-meshheading:15951103-Computing Methodologies, pubmed-meshheading:15951103-Gene Expression Profiling, pubmed-meshheading:15951103-Gene Expression Regulation, pubmed-meshheading:15951103-Gene Expression Regulation, Developmental, pubmed-meshheading:15951103-Linear Models, pubmed-meshheading:15951103-Models, Genetic, pubmed-meshheading:15951103-Models, Statistical, pubmed-meshheading:15951103-Models, Theoretical, pubmed-meshheading:15951103-RNA, Messenger, pubmed-meshheading:15951103-Rats, pubmed-meshheading:15951103-Software, pubmed-meshheading:15951103-Systems Biology, pubmed-meshheading:15951103-Time Factors
pubmed:year
2005
pubmed:articleTitle
EXAMINE: a computational approach to reconstructing gene regulatory networks.
pubmed:affiliation
Department of Computer Science, College of Information Science and Technology, Peter Kiewit Institute 378, University of Nebraska at Omaha, Omaha, NE 68182-0116, USA. xdeng@mail.unomaha.edu
pubmed:publicationType
Journal Article, Research Support, U.S. Gov't, P.H.S., Research Support, U.S. Gov't, Non-P.H.S., Research Support, N.I.H., Extramural