The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
IDENTIFICATION OF GENETIC NETWORKS FROM A SMALL NUMBER OF GENE EXPRESSION PATTERNS UNDER THE BOOLEAN NETWORK MODEL
Abstract
Liang, Fuhrman and Somogyi (PSB98, 18-29, 1998) have described an algorithm for inferring genetic network architectures from state transition tables which correspond to time series of gene expression patterns, using the Boolean network model. Their results of computational experiments suggested that a small number of state transition (INPUT/OUTPUT) pairs are sufficient in order to infer the original Boolean network correctly. This paper gives a mathematical proof for their observation. Precisely, this paper devises a much simpler algorithm for the same problem and proves that, if the indegree of each node (i.e., the number of input nodes to each node) is bounded by a constant, only O(log n) state transition pairs (from 2n pairs) are necessary and sufficient to identify the original Boolean network of n nodes correctly with high probability. We made computational experiments in order to expose the constant factor involved in O(log n) notation. The computational results show that the Boolean network of size 100,000 can be identified by our algorithm from about 100 INPUT/OUTPUT pairs if the maximum indegree is bounded by 2. It is also a merit of our algorithm that the algorithm is conceptually so simple that it is extensible for more realistic network models.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Exploring the Metabolic and Genetic Control of Gene Expression on a Genomic Scale
DeRisi, J. L., Iyer, V. R., & Brown, P. O. (1997) · Science · doi:10.1126/science.278.5338.680 · Cited by 4,456
Reveal, a general reverse engineering algorithm for inference of genetic network architectures.
Liang, S., Fuhrman, S., & Somogyi, R. (1998) · PubMed · Cited by 951
Large-scale temporal gene expression mapping of central nervous system development
Wen, X., Fuhrman, S., Michaels, G. S., Carr, D. B., Smith, S., Barker, J. L., & Somogyi, R. (1998) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.95.1.334 · Cited by 648
Circuit Simulation of Genetic Networks
McAdams, H. H., & Shapiro, L. (1995) · Science · doi:10.1126/science.7624793 · Cited by 517
Thomas, R., Thieffry, D., & Kaufman, M. (1995) · Bulletin of Mathematical Biology · doi:10.1007/bf02460618 · Cited by 496
A test case of correlation metric construction of a reaction pathway from measurements
Arkin, A., Shen, P., & Ross, J. (1997) · Science · doi:10.1126/science.277.5330.1275 · Cited by 291
Genomic regulation modeled as a network with basins of attraction.
Wuensche, A. (1998) · PubMed · Cited by 133
Cited by
Molecular ecological network analyses
Deng, Y., Jiang, Y.-H., Yang, Y., He, Z., Luo, F., & Zhou, J. (2012) · BMC Bioinformatics · doi:10.1186/1471-2105-13-113 · Cited by 3,196
Modeling and Simulation of Genetic Regulatory Systems: A Literature Review
de Jong, H. (2002) · Journal of Computational Biology · doi:10.1089/10665270252833208 · Cited by 2,663
Probabilistic Boolean networks: a rule-based uncertainty model for gene regulatory networks
Shmulevich, I., Dougherty, E. R., Kim, S., & Zhang, W. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.2.261 · Cited by 1,608
Modelling and analysis of gene regulatory networks
Karlebach, G., & Shamir, R. (2008) · Nature Reviews Molecular Cell Biology · doi:10.1038/nrm2503 · Cited by 1,296
Genetic network inference: from co-expression clustering to reverse engineering
D’haeseleer, P., Liang, S., & Somogyi, R. (2000) · Bioinformatics · doi:10.1093/bioinformatics/16.8.707 · Cited by 944
Metadata
- Authors
- AKUTSU, T., MIYANO, S., & KUHARA, S.
- Venue
- Biocomputing '99
- Publisher
- WORLD SCIENTIFIC
- Published
- 1998-12
- Pages
- 17-28
- OpenAlex
- W2079829409
- Cited by
- 689
- References
- 7
- FWCI
- 24.34
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: IDENTIFICATION OF GENETIC NETWORKS FROM A SMALL NUMBER OF GENE EXPRESSION PATTERNS UNDER THE BOOLEAN NETWORK MODEL. https://app.cochat.ai/papers/10.1142/9789814447300_0003
- The paper
- AKUTSU, T., MIYANO, S., & KUHARA, S. (1998). IDENTIFICATION OF GENETIC NETWORKS FROM A SMALL NUMBER OF GENE EXPRESSION PATTERNS UNDER THE BOOLEAN NETWORK MODEL. Biocomputing '99. https://doi.org/10.1142/9789814447300_0003
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.