These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
4. Network motifs come in sets: correlations in the randomization process. Ginoza R; Mugler A Phys Rev E Stat Nonlin Soft Matter Phys; 2010 Jul; 82(1 Pt 1):011921. PubMed ID: 20866662 [TBL] [Abstract][Full Text] [Related]
6. Graph animals, subgraph sampling, and motif search in large networks. Baskerville K; Grassberger P; Paczuski M Phys Rev E Stat Nonlin Soft Matter Phys; 2007 Sep; 76(3 Pt 2):036107. PubMed ID: 17930306 [TBL] [Abstract][Full Text] [Related]
7. Subgraph centrality in complex networks. Estrada E; Rodríguez-Velázquez JA Phys Rev E Stat Nonlin Soft Matter Phys; 2005 May; 71(5 Pt 2):056103. PubMed ID: 16089598 [TBL] [Abstract][Full Text] [Related]
8. Fitting a geometric graph to a protein-protein interaction network. Higham DJ; Rasajski M; Przulj N Bioinformatics; 2008 Apr; 24(8):1093-9. PubMed ID: 18344248 [TBL] [Abstract][Full Text] [Related]
9. Atomic subgraphs and the statistical mechanics of networks. Wegner AE; Olhede S Phys Rev E; 2021 Apr; 103(4-1):042311. PubMed ID: 34005963 [TBL] [Abstract][Full Text] [Related]
10. Graph Motif Entropy for Understanding Time-Evolving Networks. Zhang Z; Chen D; Bai L; Wang J; Hancock ER IEEE Trans Neural Netw Learn Syst; 2023 Apr; 34(4):1651-1665. PubMed ID: 33048762 [TBL] [Abstract][Full Text] [Related]
11. Network motifs that recur across species, including gene regulatory and protein-protein interaction networks. Borotkanics R; Lehmann H Arch Toxicol; 2015 Apr; 89(4):489-99. PubMed ID: 24847787 [TBL] [Abstract][Full Text] [Related]
12. Quantifying the connectivity of a network: the network correlation function method. Barzel B; Biham O Phys Rev E Stat Nonlin Soft Matter Phys; 2009 Oct; 80(4 Pt 2):046104. PubMed ID: 19905387 [TBL] [Abstract][Full Text] [Related]
13. Ordered cyclic motifs contribute to dynamic stability in biological and engineered networks. Ma'ayan A; Cecchi GA; Wagner J; Rao AR; Iyengar R; Stolovitzky G Proc Natl Acad Sci U S A; 2008 Dec; 105(49):19235-40. PubMed ID: 19033453 [TBL] [Abstract][Full Text] [Related]
14. Robust subgraph counting with distribution-free random graph analysis. van Leeuwaarden JSH; Stegehuis C Phys Rev E; 2021 Oct; 104(4-1):044313. PubMed ID: 34781540 [TBL] [Abstract][Full Text] [Related]
15. The Index-based Subgraph Matching Algorithm with General Symmetries (ISMAGS): exploiting symmetry for faster subgraph enumeration. Houbraken M; Demeyer S; Michoel T; Audenaert P; Colle D; Pickavet M PLoS One; 2014; 9(5):e97896. PubMed ID: 24879305 [TBL] [Abstract][Full Text] [Related]