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.
23. MODA: an efficient algorithm for network motif discovery in biological networks. Omidi S; Schreiber F; Masoudi-Nejad A Genes Genet Syst; 2009 Oct; 84(5):385-95. PubMed ID: 20154426 [TBL] [Abstract][Full Text] [Related]
24. Bridge and brick network motifs: identifying significant building blocks from complex biological systems. Huang CY; Cheng CY; Sun CT Artif Intell Med; 2007 Oct; 41(2):117-27. PubMed ID: 17825540 [TBL] [Abstract][Full Text] [Related]
25. MODIT: MOtif DIscovery in Temporal Networks. Grasso R; Micale G; Ferro A; Pulvirenti A Front Big Data; 2021; 4():806014. PubMed ID: 35281988 [TBL] [Abstract][Full Text] [Related]
26. NemoProfile as an efficient approach to network motif analysis with instance collection. Kim W; Haukap L BMC Bioinformatics; 2017 Oct; 18(Suppl 12):423. PubMed ID: 29072139 [TBL] [Abstract][Full Text] [Related]
27. Biomolecular network motif counting and discovery by color coding. Alon N; Dao P; Hajirasouliha I; Hormozdiari F; Sahinalp SC Bioinformatics; 2008 Jul; 24(13):i241-9. PubMed ID: 18586721 [TBL] [Abstract][Full Text] [Related]
28. CytoKavosh: a cytoscape plug-in for finding network motifs in large biological networks. Masoudi-Nejad A; Ansariola M; Kashani ZR; Salehzadeh-Yazdi A; Khakabimamaghani S PLoS One; 2012; 7(8):e43287. PubMed ID: 22952659 [TBL] [Abstract][Full Text] [Related]
30. 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]
31. Discovery of network motifs based on induced subgraphs using a dynamic expansion tree. Patra S Comput Biol Chem; 2021 Aug; 93():107530. PubMed ID: 34139395 [TBL] [Abstract][Full Text] [Related]
32. Combinatorial algorithm for counting small induced graphs and orbits. Hočevar T; Demšar J PLoS One; 2017; 12(2):e0171428. PubMed ID: 28182743 [TBL] [Abstract][Full Text] [Related]
33. Application of Fractal Theory on Motifs Counting in Biological Networks. Joveini MBZ; Sadri J IEEE/ACM Trans Comput Biol Bioinform; 2018; 15(2):613-623. PubMed ID: 28114034 [TBL] [Abstract][Full Text] [Related]
34. IndeCut evaluates performance of network motif discovery algorithms. Ansariola M; Megraw M; Koslicki D Bioinformatics; 2018 May; 34(9):1514-1521. PubMed ID: 29236975 [TBL] [Abstract][Full Text] [Related]
35. A New Algorithm for Counting Independent Motifs in Probabilistic Networks. Sarkar A; Ren Y; Elhesha R; Kahveci T IEEE/ACM Trans Comput Biol Bioinform; 2019; 16(4):1049-1062. PubMed ID: 29994098 [TBL] [Abstract][Full Text] [Related]
36. Constructing a minimum phylogenetic network from a dense triplet set. Habib M; To TH J Bioinform Comput Biol; 2012 Oct; 10(5):1250013. PubMed ID: 22849368 [TBL] [Abstract][Full Text] [Related]
37. Parameterized algorithmics for finding connected motifs in biological networks. Betzler N; van Bevern R; Fellows MR; Komusiewicz C; Niedermeier R IEEE/ACM Trans Comput Biol Bioinform; 2011; 8(5):1296-308. PubMed ID: 21282862 [TBL] [Abstract][Full Text] [Related]
38. Network subgraph-based approach for analyzing and comparing molecular networks. Huang CH; Zaenudin E; Tsai JJP; Kurubanjerdjit N; Ng KL PeerJ; 2022; 10():e13137. PubMed ID: 35529499 [TBL] [Abstract][Full Text] [Related]
39. EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences. Hu J; Yang YD; Kihara D BMC Bioinformatics; 2006 Jul; 7():342. PubMed ID: 16839417 [TBL] [Abstract][Full Text] [Related]
40. A review on models and algorithms for motif discovery in protein-protein interaction networks. Ciriello G; Guerra C Brief Funct Genomic Proteomic; 2008 Mar; 7(2):147-56. PubMed ID: 18443014 [TBL] [Abstract][Full Text] [Related] [Previous] [Next] [New Search]