The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Algorithms for Identifying Boolean Networks and Related Biological Networks Based on Matrix Multiplication and Fingerprint Function
Abstract
Due to the recent progress of the DNA microarray technology, a large number of gene expression profile data are being produced. How to analyze gene expression data is an important topic in computational molecular biology. Several studies have been done using the Boolean network as a model of a genetic network. This paper proposes efficient algorithms for identifying Boolean networks of bounded indegree and related biological networks, where identification of a Boolean network can be formalized as a problem of identifying many Boolean functions simultaneously. For the identification of a Boolean network, an O(mnD+1) time naive algorithm and a simple O (mnD) time algorithm are known, where n denotes the number of nodes, m denotes the number of examples, and D denotes the maximum in degree. This paper presents an improved O(momega-2nD + mnD+omega-3) time Monte-Carlo type randomized algorithm, where omega is the exponent of matrix multiplication (currently, omega < 2.376). The algorithm is obtained by combining fast matrix multiplication with the randomized fingerprint function for string matching. Although the algorithm and its analysis are simple, the result is nontrivial and the technique can be applied to several related problems.
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
Valiant, L. G. (1984) · Communications of the ACM · doi:10.1145/1968.1972 · Cited by 3,279
Matrix multiplication via arithmetic progressions
Coppersmith, D., & Winograd, S. (1990) · Journal of Symbolic Computation · doi:10.1016/s0747-7171(08)80013-2 · Cited by 2,248
Cited by
TIGRESS: Trustful Inference of Gene REgulation using Stability Selection
Haury, A.-C., Mordelet, F., Vera-Licona, P., & Vert, J.-P. (2012) · BMC Systems Biology · doi:10.1186/1752-0509-6-145 · Cited by 414
Dynamic modeling of genetic networks using genetic algorithm and S-system
Kikuchi, S., Tominaga, D., Arita, M., Takahashi, K., & Tomita, M. (2003) · Bioinformatics · doi:10.1093/bioinformatics/btg027 · Cited by 401
Fundamentals of cDNA microarray data analysis
Leung, Y. F., & Cavalieri, D. (2003) · Trends in Genetics · doi:10.1016/j.tig.2003.09.015 · Cited by 331
Lezon, T. R., Banavar, J. R., Cieplak, M., Maritan, A., & Fedoroff, N. V. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0609152103 · Cited by 269
HyBrow: a prototype system for computer-aided hypothesis evaluation
Racunas, S. A., Shah, N. H., Albert, I., & Fedoroff, N. V. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth905 · Cited by 70
Metadata
- Authors
- Akutsu, T., Miyano, S., & Kuhara, S.
- Venue
- Journal of Computational Biology
- Publisher
- SAGE Publications
- Published
- 2000-08
- Volume
- 7
- Issue
- 3-4
- Pages
- 331-343
- ISSN
- 1066-5277 (ISSN-L)
- 1557-8666
- OpenAlex
- W2610714868
- Cited by
- 168
- References
- 2
- FWCI
- 3.04
- Type
- journal article
- 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: Algorithms for Identifying Boolean Networks and Related Biological Networks Based on Matrix Multiplication and Fingerprint Function. https://app.cochat.ai/papers/10.1089/106652700750050817
- The paper
- Akutsu, T., Miyano, S., & Kuhara, S. (2000). Algorithms for Identifying Boolean Networks and Related Biological Networks Based on Matrix Multiplication and Fingerprint Function. Journal of Computational Biology. https://doi.org/10.1089/106652700750050817
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.