Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking
The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
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
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 · cited 8×
“In the past decade, new technologies have enabled the observation and study of networks of thousands and millions of nodes, such as social networks, computer networks, and, notably, biological networks, including protein-protein interaction networks [4,5,6], genetic regulatory networks [12,18], and metabolic networks…”
BackgroundMethodResultInfluentialLethality and centrality in protein networks
Jeong, H., Mason, S. P., Barabási, A.-L., & Oltvai, Z. N. (2001) · Nature · doi:10.1038/35075138 · Cited by 5,287
The Large-Scale Organization of Metabolic Networks
Jeong, H., Tombor, B., Albert, R., Oltvai, Z. N., & Barabási, A.-L. (2000) · Nature · doi:10.1038/35036627 · Cited by 4,972
Network motifs in the transcriptional regulation network of Escherichia coli
Shen-Orr, S. S., Milo, R., Mangan, S., & Alon, U. (2002) · Nature Genetics · doi:10.1038/ng881 · Cited by 2,952
An Algorithm for Subgraph Isomorphism
Ullmann, J. R. (1976) · Journal of the ACM · doi:10.1145/321921.321925 · Cited by 2,277
Structure and function of the feed-forward loop network motif
Mangan, S., & Alon, U. (2003) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.2133841100 · Cited by 1,827
Evidence for dynamically organized modularity in the yeast protein–protein interaction network
Han, J.-D. J., Bertin, N., Hao, T., Goldberg, D. S., Berriz, G. F., Zhang, L. V., Dupuy, D., Walhout, A. J. M., Cusick, M. E., Roth, F. P., et al. (2004) · Nature · doi:10.1038/nature02555 · Cited by 1,798
Superfamilies of Evolved and Designed Networks
Milo, R., Itzkovitz, S., Kashtan, N., Levitt, R., Shen-Orr, S., Ayzenshtat, I., Sheffer, M., & Alon, U. (2004) · Science · doi:10.1126/science.1089167 · Cited by 1,412
TRANSCRIPTION OF EUKARYOTIC PROTEIN-CODING GENES
Lee, T. I., & Young, R. A. (2000) · Annual Review of Genetics · doi:10.1146/annurev.genet.34.1.77 · Cited by 860
The art and design of genetic screens: Drosophila melanogaster
St Johnston, D. (2002) · Nature Reviews Genetics · doi:10.1038/nrg751 · Cited by 644
The Coherent Feedforward Loop Serves as a Sign-sensitive Delay Element in Transcription Networks
Mangan, S., Zaslaver, A., & Alon, U. (2003) · Journal of Molecular Biology · doi:10.1016/j.jmb.2003.09.049 · Cited by 553
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
Ronen, M., Rosenberg, R., Shraiman, B. I., & Alon, U. (2002) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.152046799 · Cited by 532
Just-in-time transcription program in metabolic pathways
Zaslaver, A., Mayo, A. E., Rosenberg, R., Bashkin, P., Sberro, H., Tsalyuk, M., Surette, M. G., & Alon, U. (2004) · Nature Genetics · doi:10.1038/ng1348 · Cited by 471
Ordering Genes in a Flagella Pathway by Analysis of Expression Kinetics from Living Bacteria
Kalir, S., McClure, J., Pabbaraju, K., Southward, C., Ronen, M., Leibler, S., Surette, M. G., & Alon, U. (2001) · Science · doi:10.1126/science.1058758 · Cited by 373
Vázquez, A., Dobrin, R., Sergi, D., Eckmann, J.-P., Oltvai, Z. N., & Barabási, A.-L. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0406024101 · Cited by 346
Costanzo, M. C. (2001) · Nucleic Acids Research · doi:10.1093/nar/29.1.75 · Cited by 329
Aggregation of topological motifs in the Escherichia coli transcriptional regulatory network
Dobrin, R., Beg, Q. K., Barabási, A.-L., & Oltvai, Z. N. (2004) · BMC Bioinformatics · doi:10.1186/1471-2105-5-10 · Cited by 225
Inferring network mechanisms: The Drosophila melanogaster protein interaction network
Middendorf, M., Ziv, E., & Wiggins, C. H. (2005) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0409515102 · Cited by 196
Topological generalizations of network motifs
Kashtan, N., Itzkovitz, S., Milo, R., & Alon, U. (2004) · Physical Review E · doi:10.1103/physreve.70.031909 · Cited by 194
Janssen, W. H., & Kuiken, M. J. (1993) · Cited by 173
Subgraph ensembles and motif discovery using an alternative heuristic for graph isomorphism
Baskerville, K., & Paczuski, M. (2006) · Physical Review E · doi:10.1103/physreve.74.051903 · Cited by 32
Systematic identification of statistically significant network measures
Ziv, E., Koytcheff, R., Middendorf, M., et al. (2005) · Physical Review E · doi:10.1103/physreve.71.016110 · Cited by 31
An Important Connection Between Network Motifs and Parsimony Models
Przytycka, T. M. (2006) · Lecture notes in computer science · doi:10.1007/11732990_27 · Cited by 24
Cited by
Resisting structural re-identification in anonymized social networks
Hay, M., Miklau, G., Jensen, D., Towsley, D., & Weis, P. (2008) · Proceedings of the VLDB Endowment · doi:10.14778/1453856.1453873 · Cited by 549
Computational approaches for detecting protein complexes from protein interaction networks: a survey
Li, X., Wu, M., Kwoh, C.-K., & Ng, S.-K. (2010) · BMC Genomics · doi:10.1186/1471-2164-11-s1-s3 · Cited by 349
Metadata
- Authors
- Grochow, J. A., & Kellis, M.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2007-05-17
- Pages
- 92-106
- OpenAlex
- W1553420678
- Cited by
- 297
- References
- 24
- FWCI
- 33.92
- 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
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.