The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Topological generalizations of network motifs
Open accessAbstract
Biological and technological networks contain patterns, termed network motifs, which occur far more often than in randomized networks. Network motifs were suggested to be elementary building blocks that carry out key functions in the network. It is of interest to understand how network motifs combine to form larger structures. To address this, we present a systematic approach to define "motif generalizations": families of motifs of different sizes that share a common architectural theme. To define motif generalizations, we first define "roles" in a subgraph according to structural equivalence. For example, the feedforward loop triad--a motif in transcription, neuronal, and some electronic networks--has three roles: an input node, an output node, and an internal node. The roles are used to define possible generalizations of the motif. The feedforward loop can have three simple generalizations, based on replicating each of the three roles and their connections. We present algorithms for efficiently detecting motif generalizations. We find that the transcription networks of bacteria and yeast display only one of the three generalizations, the multi-output feedforward generalization. In contrast, the neuronal network of C. elegans mainly displays the multi-input generalization. Forward-logic electronic circuits display a multi-input, multi-output hybrid. Thus, networks which share a common motif can have very different generalizations of that motif. Using mathematical modeling, we describe the information processing functions of the different motif generalizations in transcription, neuronal, and electronic networks.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Social Network Analysis: Methods and Applications
Wasserman, S., & Faust, K. (1994) · doi:10.1017/cbo9780511815478 · Cited by 17,557
Network motifs: simple building blocks of complex networks.
Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., & Alon, U. (2002) · Science · doi:10.1126/science.298.5594.824 · Cited by 7,368
Self-citationThe structure of the nervous system of the nematode Caenorhabditis elegans
White, J. G., Southgate, E., Thomson, J. N., & Brenner, S. (1986) · Philosophical Transactions of the Royal Society of London. B, Biological Sciences · doi:10.1098/rstb.1986.0056 · Cited by 5,589
From molecular to modular cell biology.
Hartwell, L. H., Hopfield, J. J., Leibler, S., & Murray, A. W. (1999) · Nature · doi:10.1038/35011540 · Cited by 3,632
Specificity and Stability in Topology of Protein Networks
Maslov, S., & Sneppen, K. (2002) · Science · doi:10.1126/science.1065103 · Cited by 3,051
Transcriptional Regulatory Networks in Saccharomyces cerevisiae
Lee, T. I., Rinaldi, N. J., Robert, F., Odom, D. T., Bar-Joseph, Z., Gerber, G. K., Hannett, N. M., Harbison, C. T., Thompson, C. M., Simon, I., et al. (2002) · Science · doi:10.1126/science.1075090 · Cited by 2,956
Combinational profiles of sequential benchmark circuits
Brglez, F., Bryan, D., & Kozminski, K. (2003) · IEEE International Symposium on Circuits and Systems · doi:10.1109/iscas.1989.100747 · Cited by 2,095
The neural circuit for touch sensitivity in Caenorhabditis elegans
Chalfie, M., Sulston, J., White, J., Southgate, E., Thomson, J., & Brenner, S. (1985) · The Journal of Neuroscience · doi:10.1523/jneurosci.05-04-00956.1985 · Cited by 1,093
Biological networks: the tinkerer as an engineer
Alon, U. (2003) · Science · doi:10.1126/science.1089072 · Cited by 706
Self-citationActive Currents Regulate Sensitivity and Dynamic Range in C. elegans Neurons
Goodman, M. B., Hall, D. H., Avery, L., & Lockery, S. R. (1998) · Neuron · doi:10.1016/s0896-6273(00)81014-4 · Cited by 370
Topology of technology graphs: Small world patterns in electronic circuits
Cancho, R. F. I., Janssen, C., & Solé, R. V. (2001) · Physical Review E · doi:10.1103/physreve.64.046119 · Cited by 265
Response Delays and the Structure of Transcription Networks
Rosenfeld, N., & Alon, U. (2003) · Journal of Molecular Biology · doi:10.1016/s0022-2836(03)00506-0 · Cited by 148
Self-citation
Cited by
Network motifs: theory and experimental approaches
Alon, U. (2007) · Nature Reviews Genetics · doi:10.1038/nrg2102 · Cited by 3,279
Self-citationSpontaneous evolution of modularity and network motifs
Kashtan, N., & Alon, U. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0503610102 · Cited by 878
Self-citationMillan, M. J. (2006) · Pharmacology & Therapeutics · doi:10.1016/j.pharmthera.2005.11.006 · Cited by 551
Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
Kashtan, N., Itzkovitz, S., Milo, R., & Alon, U. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth163 · Cited by 537
Self-citationGraph theory and networks in Biology
Mason, O., & Verwoerd, M. (2007) · IET Systems Biology · doi:10.1049/iet-syb:20060038 · Cited by 398
Metadata
- Authors
- Kashtan, N., Itzkovitz, S., Milo, R., & Alon, U.
- Venue
- Physical Review E
- Publisher
- American Physical Society (APS)
- Published
- 2004-09-23
- Volume
- 70
- Issue
- 3
- Pages
- 031909-031909
- ISSN
- 1539-3755 (ISSN-L)
- 1550-2376
- OpenAlex
- W2057680921
- Cited by
- 194
- References
- 12
- FWCI
- 8.64
- Type
- journal article
- Language
- en
- Open access
- green
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
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.