The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
FANMOD: a tool for fast network motif detection
Open accessAbstract
Summary: Motifs are small connected subnetworks that a network displays in significantly higher frequencies than would be expected for a random network. They have recently gathered much attention as a concept to uncover structural design principles of complex biological networks. FANMOD is a tool for fast network motif detection; it relies on recently developed algorithms to improve the efficiency of network motif detection by some orders of magnitude over existing tools. This facilitates the detection of larger motifs in bigger networks than previously possible. Additional benefits of FANMOD are the ability to analyze colored networks, a graphical user interface and the ability to export results to a variety of machine- and human-readable file formats including comma-separated values and HTML. Availability: The tool is freely available online at and runs under Linux, Mac OS and Windows. Contact: wernicke@minet.uni-jena.de
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
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
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
Pajek— Analysis and Visualization of Large Networks
Batagelj, V., & Mrvar, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45848-4_54 · Cited by 708
(2004) · Mathematics and Visualization · doi:10.1007/978-3-642-18638-7 · Cited by 540
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
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
MAVisto: a tool for the exploration of network motifs
Schreiber, F., & Schwobbermeyer, H. (2005) · Bioinformatics · doi:10.1093/bioinformatics/bti556 · Cited by 209
Conserved network motifs allow protein–protein interaction prediction
Albert, I., & Albert, R. (2004) · Bioinformatics · doi:10.1093/bioinformatics/bth402 · Cited by 188
Coarse-graining and self-dissimilarity of complex networks
Itzkovitz, S., Levitt, R., Kashtan, N., Milo, R., Itzkovitz, M., & Alon, U. S. (2005) · Physical Review E · doi:10.1103/physreve.71.016127 · Cited by 149
Research works printed but not linked: 2
- McKay, 1981, Practical graph isomorphism, Congr. Numer., 30, 45
- Smart, 2005, Cross-Platform GUI Programming with wxWidgets
Cited by
Higher-order organization of complex networks
Benson, A. R., Gleich, D. F., & Leskovec, J. (2016) · Science · doi:10.1126/science.aad9029 · Cited by 1,270
Identification of Functional Elements and Regulatory Circuits by Drosophila modENCODE
The modENCODE Consortium, Roy, S., Ernst, J., Kharchenko, P. V., Kheradpour, P., Negre, N., Eaton, M. L., Landolin, J. M., Bristow, C. A., Ma, L., et al. (2010) · Science · doi:10.1126/science.1198374 · Cited by 1,223
Knowledge sharing and yahoo answers: everyone knows something
Adamic, L. A., Zhang, J., Bakshy, E., & Ackerman, M. S. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367587 · Cited by 732
Dynamic regulatory network controlling TH17 cell differentiation
Yosef, N., Shalek, A. K., Gaublomme, J. T., Jin, H., Lee, Y., Awasthi, A., Wu, C., Karwacz, K., Xiao, S., Jorgolli, M., et al. (2013) · Nature · doi:10.1038/nature11981 · Cited by 682
Liu, Z.-P., Wu, C., Miao, H., & Wu, H. (2015) · Database · doi:10.1093/database/bav095 · Cited by 555
Paranjape, A., Benson, A. R., & Leskovec, J. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018731 · Cited by 540
Hypergraphs and Cellular Networks
Klamt, S., Haus, U.-U., & Theis, F. (2009) · PLoS Computational Biology · doi:10.1371/journal.pcbi.1000385 · Cited by 480
The dynamics of animal social networks: analytical, conceptual, and theoretical advances
Pinter-Wollman, N., Hobson, E. A., Smith, J. E., Edelman, A. J., Shizuka, D., de Silva, S., Waters, J. S., Prager, S. D., Sasaki, T., Wittemyer, G., et al. (2014) · Behavioral Ecology · doi:10.1093/beheco/art047 · Cited by 436
Graph-based methods for analysing networks in cell biology
Aittokallio, T. (2006) · Briefings in Bioinformatics · doi:10.1093/bib/bbl022 · Cited by 429
Efficient Detection of Network Motifs
Wernicke, S. (2006) · IEEE/ACM Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2006.51 · Cited by 402
Self-citationA tutorial in connectome analysis: Topological and spatial features of brain networks
Kaiser, M. (2011) · NeuroImage · doi:10.1016/j.neuroimage.2011.05.025 · Cited by 371
Acoustic sequences in non‐human animals: a tutorial review and prospectus
Kershenbaum, A., Blumstein, D. T., Roch, M. A., Akçay, Ç., Backus, G., Bee, M. A., Bohn, K., Cao, Y., Carter, G., Cäsar, C., et al. (2016) · Biological Reviews · doi:10.1111/brv.12160 · Cited by 337
Morgan, R. J., & Soltesz, I. (2008) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0801372105 · Cited by 347
Analysis of biological networks
(2017) · Molecular Data Analysis Using R · doi:10.1002/9781119165057.ch10 · Cited by 323
Improving Graph Neural Network Expressivity via Subgraph Isomorphism Counting
Bouritsas, G., Frasca, F., Zafeiriou, S., & Bronstein, M. M. (2023) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3154319 · Cited by 309
Vaast, E., Safadi, H., Lapointe, L., & Negoita, B. (2017) · MIS Quarterly · doi:10.25300/misq/2017/41.4.08 · Cited by 289
Hubba: hub objects analyzer—a framework of interactome hubs identification for network biology
Lin, C.-Y., Chin, C.-H., Wu, H.-H., Chen, S.-H., Ho, C.-W., & Ko, M.-T. (2008) · Nucleic Acids Research · doi:10.1093/nar/gkn257 · Cited by 287
The Multilayer Connectome of Caenorhabditis elegans
Bentley, B., Branicky, R., Barnes, C. L., Chew, Y. L., Yemini, E., Bullmore, E. T., Vértes, P. E., & Schafer, W. R. (2016) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005283 · Cited by 269
A survey of Twitter research: Data model, graph structure, sentiment analysis and attacks
Antonakaki, D., Fragopoulou, P., & Ioannidis, S. (2021) · Expert Systems with Applications · doi:10.1016/j.eswa.2020.114006 · Cited by 265
A Guide to Conquer the Biological Network Era Using Graph Theory
Koutrouli, M., Karatzas, E., Paez-Espino, D., & Pavlopoulos, G. A. (2020) · Frontiers in Bioengineering and Biotechnology · doi:10.3389/fbioe.2020.00034 · Cited by 264
The Architecture of the Human RNA-Binding Protein Regulatory Network
Quattrone, A., & Dassi, E. (2019) · iScience · doi:10.1016/j.isci.2019.10.058 · Cited by 53
igraph 1.0 enables fast and robust network analysis across programming languages
Antonov, M., Csárdi, G., Horvát, S., Müller, K., Nepusz, T., Noom, D., Salmon, M., Traag, V., Welles, B. F., & Zanini, F. (2026) · PLOS One · doi:10.1371/journal.pone.0355108 · Cited by 56
“…providing efficient implementations of widely used algorithms, many of which are not available in any other library, including for determining shortest paths [20], vertex centrality [21,22], cycle bases [23], motif finding [24], clique finding [25], community detection [26], and graph layout [27].”
Huang, C.-H., Tsai, J. J. P., Kurubanjerdjit, N., & Ng, K.-L. (2019) · doi:10.1101/536318 · Cited by 4
Metadata
- Authors
- Wernicke, S., & Rasche, F.
- Venue
- Bioinformatics
- Publisher
- Oxford University Press (OUP)
- Published
- 2006-02-02
- Volume
- 22
- Issue
- 9
- Pages
- 1152-1153
- ISSN
- 1367-4803 (ISSN-L)
- 1367-4811
- OpenAlex
- W2112262143
- Cited by
- 745
- References
- 12
- FWCI
- 6.75
- Type
- journal article
- Language
- en
- Open access
- bronze
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.