{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,8]],"date-time":"2026-06-08T10:03:44Z","timestamp":1780913024205,"version":"3.54.1"},"reference-count":88,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T00:00:00Z","timestamp":1535932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003130","name":"Fonds Wetenschappelijk Onderzoek","doi-asserted-by":"publisher","award":["Evolving graph patterns"],"award-info":[{"award-number":["Evolving graph patterns"]}],"id":[{"id":"10.13039\/501100003130","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BioData Mining"],"published-print":{"date-parts":[[2018,12]]},"DOI":"10.1186\/s13040-018-0181-9","type":"journal-article","created":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T14:49:54Z","timestamp":1535986194000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":40,"title":["Grasping frequent subgraph mining for bioinformatics applications"],"prefix":"10.1186","volume":"11","author":[{"given":"Aida","family":"Mrzic","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pieter","family":"Meysman","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wout","family":"Bittremieux","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pieter","family":"Moris","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boris","family":"Cule","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bart","family":"Goethals","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8217-2564","authenticated-orcid":false,"given":"Kris","family":"Laukens","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,9,3]]},"reference":[{"issue":"suppl 1","key":"181_CR1","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1093\/bioinformatics\/bth919","volume":"20","author":"M Koyut\u00fcrk","year":"2004","unstructured":"Koyut\u00fcrk M, Grama A, Szpankowski W. An efficient algorithm for detecting frequent subgraphs in biological networks. Bioinformatics. 2004; 20(suppl 1):200\u20137.","journal-title":"Bioinformatics"},{"issue":"suppl 1","key":"181_CR2","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1093\/bioinformatics\/bti1049","volume":"21","author":"H Hu","year":"2005","unstructured":"Hu H, Yan X, Huang Y, Han J, Zhou XJ. Mining coherent dense subgraphs across massive biological networks for functional discovery. Bioinformatics. 2005; 21(suppl 1):213\u201321.","journal-title":"Bioinformatics"},{"issue":"20","key":"181_CR3","doi-asserted-by":"publisher","first-page":"2775","DOI":"10.1093\/bioinformatics\/btm409","volume":"23","author":"A Cakmak","year":"2007","unstructured":"Cakmak A, Ozsoyoglu G. Mining biological networks for unknown pathways. Bioinformatics. 2007; 23(20):2775\u201383.","journal-title":"Bioinformatics"},{"issue":"1","key":"181_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s13040-015-0038-4","volume":"8","author":"P Meysman","year":"2015","unstructured":"Meysman P, Zhou C, Cule B, Goethals B, Laukens K. Mining the entire protein databank for frequent spatially cohesive amino acid patterns. BioData Min. 2015; 8(1):1.","journal-title":"BioData Min"},{"issue":"01","key":"181_CR5","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0269888912000331","volume":"28","author":"C Jiang","year":"2013","unstructured":"Jiang C, Coenen F, Zito M. A survey of frequent subgraph mining algorithms. Knowl Eng Rev. 2013; 28(01):75\u2013105.","journal-title":"Knowl Eng Rev"},{"issue":"1","key":"181_CR6","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X. Frequent pattern mining: current status and future directions. Data Min Knowl Disc. 2007; 15(1):55\u201386.","journal-title":"Data Min Knowl Disc"},{"issue":"1","key":"181_CR7","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1145\/959242.959249","volume":"5","author":"T Washio","year":"2003","unstructured":"Washio T, Motoda H. State of the art of graph-based data mining. SIGKDD Explor Newsl. 2003; 5(1):59\u201368.","journal-title":"SIGKDD Explor Newsl"},{"key":"181_CR8","volume-title":"The graph isomorphism problem. Technical report, Technical Report 96-20","author":"S Fortin","year":"1996","unstructured":"Fortin S. The graph isomorphism problem. Technical report, Technical Report 96-20. Edomonton: University of Alberta; 1996."},{"key":"181_CR9","doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H. An apriori-based algorithm for mining frequent substructures from graph data. In: Proceedings of the 4th European Conference on Principles of Data Mining and Knowledge Discovery. PKDD \u201900: 2000. p. 13\u201323.","DOI":"10.1007\/3-540-45372-5_2"},{"key":"181_CR10","unstructured":"Yan X, Han J. gspan: Graph-based substructure pattern mining. In: Proceedings of the 2002 IEEE International Conference on Data Mining. ICDM \u201902: 2002. p. 721."},{"key":"181_CR11","doi-asserted-by":"crossref","unstructured":"Zaki MJ. Efficiently mining frequent trees in a forest. In: Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201902: 2002. p. 71\u201380.","DOI":"10.1145\/775056.775058"},{"key":"181_CR12","doi-asserted-by":"crossref","unstructured":"Asai T, Abe K, Kawasoe S, Arimura H, Sakamoto H, Arikawa S. Efficient substructure discovery from large semi-structured data. In: Proceedings of the 2002 SIAM International Conference on Data Mining: 2002. p. 158\u201374.","DOI":"10.1137\/1.9781611972726.10"},{"issue":"8","key":"181_CR13","doi-asserted-by":"publisher","first-page":"974","DOI":"10.1093\/bioinformatics\/btl030","volume":"22","author":"N Pr\u017eulj","year":"2006","unstructured":"Pr\u017eulj N, Corneil DG, Jurisica I. Efficient estimation of graphlet frequency distributions in protein\u2013protein interaction networks. Bioinformatics. 2006; 22(8):974\u201380.","journal-title":"Bioinformatics"},{"issue":"2","key":"181_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1093\/bioinformatics\/btl301","volume":"23","author":"N Pr\u017eulj","year":"2007","unstructured":"Pr\u017eulj N. Biological network comparison using graphlet degree distribution. Bioinformatics. 2007; 23(2):177\u201383.","journal-title":"Bioinformatics"},{"issue":"4","key":"181_CR15","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1093\/bioinformatics\/btt717","volume":"30","author":"T Ho\u010devar","year":"2013","unstructured":"Ho\u010devar T, Dem\u0161ar J. A combinatorial approach to graphlet counting. Bioinformatics. 2013; 30(4):559\u201365.","journal-title":"Bioinformatics"},{"key":"181_CR16","doi-asserted-by":"crossref","unstructured":"He H, Singh AK. Graphrank: Statistical modeling and mining of significant subgraphs in the feature space. In: Proceedings of the Sixth International Conference on Data Mining. ICDM \u201906: 2006. p. 885\u201390.","DOI":"10.1109\/ICDM.2006.79"},{"issue":"11","key":"181_CR17","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1021\/ci900035z","volume":"49","author":"S Ranu","year":"2009","unstructured":"Ranu S, Singh AK. Mining statistically significant molecular substructures for efficient molecular classification. J Chem Inf Model. 2009; 49(11):2537\u201350.","journal-title":"J Chem Inf Model"},{"issue":"11","key":"181_CR18","doi-asserted-by":"publisher","first-page":"78624","DOI":"10.1371\/journal.pone.0078624","volume":"8","author":"B Ozdemir","year":"2013","unstructured":"Ozdemir B, Abd-Almageed W, Roessler S, Wang XW. iSubgraph: integrative genomics for subgroup discovery in hepatocellular carcinoma using graph mining and mixture models. PloS one. 2013; 8(11):78624.","journal-title":"PloS one"},{"key":"181_CR19","unstructured":"Fiedler M, Borgelt C. Support computation for mining frequent subgraphs in a single graph. In: Proceedings of the 5th International Workshop on Mining and Learning with Graphs. MLG \u201907: 2007."},{"key":"181_CR20","doi-asserted-by":"crossref","unstructured":"Bringmann B, Nijssen S. What is frequent in a single graph? In: Proceedings of the 12th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining. PAKDD\u201908: 2008. p. 858\u201363.","DOI":"10.1007\/978-3-540-68125-0_84"},{"key":"181_CR21","doi-asserted-by":"crossref","unstructured":"Vanetik N, Gudes E, Shimony SE. Computing frequent graph patterns from semistructured data. In: Proceedings of the 2002 IEEE International Conference on Data Mining. ICDM \u201902: 2002. p. 458\u201365.","DOI":"10.1109\/ICDM.2002.1183988"},{"issue":"2","key":"181_CR22","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-006-0044-8","volume":"13","author":"N Vanetik","year":"2006","unstructured":"Vanetik N, Shimony SE, Gudes E. Support measures for graph data. J Data Min Knowl Discov. 2006; 13(2):243\u201360.","journal-title":"J Data Min Knowl Discov"},{"key":"181_CR23","doi-asserted-by":"crossref","unstructured":"Calders T, Ramon J, Van Dyck D. Anti-monotonic overlap-graph support measures. In: Proceedings of the Eighth IEEE International Conference on Data Mining. ICDM \u201908: 2008. p. 73\u201382.","DOI":"10.1109\/ICDM.2008.114"},{"key":"181_CR24","unstructured":"Meysman P, Saeys Y, Sabaghian E, Bittremieux W, Van de Peer Y, Goethals B, Laukens K. Discovery of significantly enriched subgraphs associated with selected vertices in a single graph. In: Proceedings of the 14th International Workshop on Data Mining in Bioinformatics. BIOKDD \u201915: 2015. p. 1\u20138."},{"key":"181_CR25","doi-asserted-by":"crossref","unstructured":"Leskovec J, Faloutsos C. Sampling from large graphs. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201906: 2006. p. 631\u20136.","DOI":"10.1145\/1150402.1150479"},{"key":"181_CR26","doi-asserted-by":"crossref","unstructured":"Zou R, Holder LB. Frequent subgraph mining on a single large graph using sampling techniques. In: Proceedings of the Eighth Workshop on Mining and Learning with Graphs. MLG \u201910: 2010. p. 171\u20138.","DOI":"10.1145\/1830252.1830274"},{"key":"181_CR27","unstructured":"Hu P, Lau WC. A survey and taxonomy of graph sampling. CoRR abs\/1308.5865; 2013."},{"key":"181_CR28","doi-asserted-by":"crossref","unstructured":"W\u00f6rlein M, Meinl T, Fischer I, Philippsen M. A quantitative comparison of the subgraph miners mofa, gspan, ffsm, and gaston. In: Proceeding of the 9th European Conference on Principles and Practice of Knowledge Discovery in Database. PKDD \u201905: 2005. p. 392\u2013403.","DOI":"10.1007\/11564126_39"},{"key":"181_CR29","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J. Efficient mining of frequent subgraphs in the presence of isomorphism. In: Proceedings of the Third IEEE International Conference on Data Mining. ICDM \u201903: 2003. p. 549\u201352.","DOI":"10.1109\/ICDM.2003.1250974"},{"issue":"1","key":"181_CR30","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.entcs.2004.12.039","volume":"127","author":"S Nijssen","year":"2005","unstructured":"Nijssen S, Kok JN. The gaston tool for frequent subgraph mining. Electronic Notes Theor Comput Sci. 2005; 127(1):77\u201387.","journal-title":"Electronic Notes Theor Comput Sci"},{"key":"181_CR31","unstructured":"Dehaspe L, Toivonen H, King RD. Finding frequent substructures in chemical compounds. In: Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining. KDD\u201998: 1998. p. 30\u20136."},{"issue":"3","key":"181_CR32","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s11030-006-9041-5","volume":"10","author":"M Hassan","year":"2006","unstructured":"Hassan M, Brown RD, Varma-O\u2019Brien S, Rogers D. Cheminformatics analysis and learning in a data pipelining environment. Mol Divers. 2006; 10(3):283\u201399.","journal-title":"Mol Divers"},{"issue":"1","key":"181_CR33","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.drudis.2012.07.016","volume":"18","author":"I Takigawa","year":"2013","unstructured":"Takigawa I, Mamitsuka H. Graph mining: procedure, application to drug discovery and recent advances. Drug Discov Today. 2013; 18(1):50\u20137.","journal-title":"Drug Discov Today"},{"key":"181_CR34","doi-asserted-by":"crossref","unstructured":"Borgelt C, Berthold MR. Mining molecular fragments: finding relevant substructures of molecules. In: Proceedings of the 2002 IEEE International Conference on Data Mining. ICDM\u201902: 2002. p. 51\u20138.","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"181_CR35","doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Bandyopadhyay D, Snoeyink J, Prins J, Tropsha A. Mining protein family specific residue packing patterns from protein structure graphs. In: Proceedings of the Eighth Annual International Conference on Resaerch in Computational Molecular Biology. RECOMB \u201904: 2004. p. 308\u201315.","DOI":"10.1145\/974614.974655"},{"issue":"2","key":"181_CR36","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1089\/cmb.2013.0092","volume":"21","author":"W Dhifli","year":"2014","unstructured":"Dhifli W, Saidi R, Nguifo EM. Smoothing 3d protein structure motifs through graph mining and amino acid similarities. J Comput Biol. 2014; 21(2):162\u201372.","journal-title":"J Comput Biol"},{"issue":"6","key":"181_CR37","doi-asserted-by":"publisher","first-page":"1537","DOI":"10.1110\/ps.062189906","volume":"15","author":"D Bandyopadhyay","year":"2006","unstructured":"Bandyopadhyay D, Huan J, Liu J, Prins J, Snoeyink J, Wang W, Tropsha A. Structure-based function inference using protein family-specific fingerprints. Protein Sci. 2006; 15(6):1537\u201343.","journal-title":"Protein Sci"},{"issue":"1","key":"181_CR38","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1186\/1471-2105-13-256","volume":"13","author":"A Ramu","year":"2012","unstructured":"Ramu A, Kahveci T, Burleigh JG. A scalable method for identifying frequent subtrees in sets of large phylogenetic trees. BMC Bioinforma. 2012; 13(1):256.","journal-title":"BMC Bioinforma"},{"issue":"1","key":"181_CR39","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1109\/TKDE.2007.190676","volume":"20","author":"S Zhang","year":"2008","unstructured":"Zhang S, Wang JT. Discovering frequent agreement subtrees from phylogenetic data. IEEE Trans Knowl Data Eng. 2008; 20(1):68\u201382.","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"181_CR40","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10115-013-0676-0","volume":"41","author":"A Deepak","year":"2014","unstructured":"Deepak A, Fern\u00e1ndez-Baca D, Tirthapura S, Sanderson MJ, McMahon MM. Evominer: frequent subtree mining in phylogenetic databases. Knowl Inf Syst. 2014; 41(3):559\u201390.","journal-title":"Knowl Inf Syst"},{"key":"181_CR41","unstructured":"Ayed R, Hacid MS, Haque R, Jemai A. An updated dashboard of Complete Search FSM Implementations in Centralized Graph Transaction Databases: BDA 2016 Gestion de Donn\u00e9es-Principes, Technologies et Applications 32 e anniversaire 15-18 novembre 2016, Poitiers, Futuroscope; 2016, p. 57."},{"key":"181_CR42","unstructured":"Inokuchi A. A fast algorithm for mining frequent connected subgraphs. IBM Research Report RT0448. 2002."},{"key":"181_CR43","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G. Frequent subgraph discovery. In: Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference On: 2001. p. 313\u201320.","DOI":"10.1109\/ICDM.2001.989534"},{"issue":"9","key":"181_CR44","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TKDE.2004.33","volume":"16","author":"M Kuramochi","year":"2004","unstructured":"Kuramochi M, Karypis G. An efficient algorithm for discovering frequent subgraphs. IEEE Trans Knowl Data Eng. 2004; 16(9):1038\u201351.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"181_CR45","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M, Li W, et al. New algorithms for fast discovery of association rules. In: KDD: 1997. p. 283\u20136.","DOI":"10.1007\/978-1-4615-5669-5_1"},{"issue":"5594","key":"181_CR46","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, Shen-Orr S, Itzkovitz S, Kashtan N, Chklovskii D, Alon U. Network motifs: simple building blocks of complex networks. Science. 2002; 298(5594):824\u20137.","journal-title":"Science"},{"issue":"2","key":"181_CR47","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.artmed.2007.07.006","volume":"41","author":"C-Y Huang","year":"2007","unstructured":"Huang C-Y, Cheng C-Y, Sun C-T. Bridge and brick network motifs: Identifying significant building blocks from complex biological systems. Artif Intell Med. 2007; 41(2):117\u201327.","journal-title":"Artif Intell Med"},{"issue":"10","key":"181_CR48","doi-asserted-by":"publisher","first-page":"1632","DOI":"10.1093\/bioinformatics\/btv026","volume":"31","author":"D. Davis","year":"2015","unstructured":"Davis D., Yaver\u011flu \u00d6N, Malod-Dognin N, Stojmirovic A, Pr\u017eulj N. Topology-function conservation in protein\u2013protein interaction networks. Bioinformatics. 2015; 31(10):1632\u20139.","journal-title":"Bioinformatics"},{"issue":"4","key":"181_CR49","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1016\/j.jmb.2007.03.013","volume":"369","author":"AP Cootes","year":"2007","unstructured":"Cootes AP, Muggleton SH, Sternberg MJ. The identification of similarities between biological networks: application to the metabolome and interactome. J Mol Biol. 2007; 369(4):1126\u201339.","journal-title":"J Mol Biol"},{"issue":"9","key":"181_CR50","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.1101\/gr.5235706","volume":"16","author":"J Flannick","year":"2006","unstructured":"Flannick J, Novak A, Srinivasan BS, McAdams HH, Batzoglou S. Graemlin: general and robust alignment of multiple large interaction networks. Genome Res. 2006; 16(9):1169\u201381.","journal-title":"Genome Res"},{"issue":"1","key":"181_CR51","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s12859-016-0913-0","volume":"17","author":"J Ruyssinck","year":"2016","unstructured":"Ruyssinck J, Demeester P, Dhaene T, Saeys Y. Netter: re-ranking gene network inference predictions using structural network properties. BMC Bioinforma. 2016; 17(1):1.","journal-title":"BMC Bioinforma"},{"issue":"2","key":"181_CR52","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1093\/bfgp\/eln015","volume":"7","author":"G Ciriello","year":"2008","unstructured":"Ciriello G, Guerra C. A review on models and algorithms for motif discovery in protein\u2013protein interaction networks. Brief Funct Genom Proteomics. 2008; 7(2):147\u2013156.","journal-title":"Brief Funct Genom Proteomics"},{"issue":"3","key":"181_CR53","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1093\/bib\/bbl022","volume":"7","author":"T Aittokallio","year":"2006","unstructured":"Aittokallio T, Schwikowski B. Graph-based methods for analysing networks in cell biology. Brief Bioinform. 2006; 7(3):243\u201355.","journal-title":"Brief Bioinform"},{"issue":"6","key":"181_CR54","doi-asserted-by":"publisher","first-page":"450","DOI":"10.1038\/nrg2102","volume":"8","author":"U Alon","year":"2007","unstructured":"Alon U. Network motifs: theory and experimental approaches. Nat Rev Genet. 2007; 8(6):450\u201361.","journal-title":"Nat Rev Genet"},{"issue":"5","key":"181_CR55","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1002\/mas.21485","volume":"36","author":"P Meysman","year":"2015","unstructured":"Meysman P, Titeca K, Eyckerman S, Tavernier J, Goethals B, Martens L, Valkenborg D, Laukens K. Protein complex analysis: From raw protein lists to protein interaction networks. Mass Spectrom Rev. 2015; 36(5):600\u201314.","journal-title":"Mass Spectrom Rev"},{"issue":"11","key":"181_CR56","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1093\/bioinformatics\/bth163","volume":"20","author":"N Kashtan","year":"2004","unstructured":"Kashtan N, Itzkovitz S, Milo R, Alon U. Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics. 2004; 20(11):1746\u201358.","journal-title":"Bioinformatics"},{"issue":"6964","key":"181_CR57","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1038\/nature02115","volume":"426","author":"AE Krause","year":"2003","unstructured":"Krause AE, Frank KA, Mason DM, Ulanowicz RE, Taylor WW. Compartments revealed in food-web structure. Nature. 2003; 426(6964):282\u20135.","journal-title":"Nature"},{"issue":"3","key":"181_CR58","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1093\/bib\/bbu021","volume":"16","author":"NTL Tran","year":"2014","unstructured":"Tran NTL, Mohan S, Xu Z, Huang C-H. Current innovations and future challenges of network motif detection. Brief Bioinform. 2014; 16(3):497\u2013525.","journal-title":"Brief Bioinform"},{"key":"181_CR59","unstructured":"Schreiber F, Schw\u00f6bbermeyer H. Towards motif detection in networks: Frequency concepts and flexible search. In: in Proceedings of the International Workshop on Network Tools and Applications in Biology (NETTAB04): 2004. p. 91\u2013102."},{"key":"181_CR60","doi-asserted-by":"crossref","unstructured":"Wernicke S. A faster algorithm for detecting network motifs. In: Proceedings of WABI \u201905: 2005. p. 165\u201377.","DOI":"10.1007\/11557067_14"},{"issue":"1","key":"181_CR61","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"ZR Kashani","year":"2009","unstructured":"Kashani ZR, Ahrabian H, Elahi E, Nowzari-Dalini A, Ansari ES, Asadi S, Mohammadi S, Schreiber F, Masoudi-Nejad A. Kavosh: a new algorithm for finding network motifs. BMC Bioinforma. 2009; 10(1):318.","journal-title":"BMC Bioinforma"},{"issue":"12","key":"181_CR62","doi-asserted-by":"publisher","first-page":"50093","DOI":"10.1371\/journal.pone.0050093","volume":"7","author":"X Li","year":"2012","unstructured":"Li X, Stones DS, Wang H, Deng H, Liu X, Wang G. NetMODE: Network Motif Detection without Nauty. PloS one. 2012; 7(12):50093.","journal-title":"PloS one"},{"issue":"5","key":"181_CR63","doi-asserted-by":"publisher","first-page":"853","DOI":"10.1109\/TCBB.2014.2321150","volume":"11","author":"LA Meira","year":"2014","unstructured":"Meira LA, M\u00e1ximo VR, Fazenda \u00c1L, Da Concei\u00e7\u00e3o AF. Acc-Motif: Accelerated Network Motif Detection. IEEE\/ACM Trans Comput Biol Bioinforma (TCBB). 2014; 11(5):853\u201362.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinforma (TCBB)"},{"issue":"10","key":"181_CR64","doi-asserted-by":"publisher","first-page":"1000523","DOI":"10.1371\/journal.pcbi.1000523","volume":"5","author":"JM Peregr\u00edn-Alvarez","year":"2009","unstructured":"Peregr\u00edn-Alvarez JM, Xiong X, Su C, Parkinson J. The modular organization of protein interactions in escherichia coli. PLoS Comput Biol. 2009; 5(10):1000523.","journal-title":"PLoS Comput Biol"},{"issue":"1","key":"181_CR65","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10844-012-0213-8","volume":"40","author":"A Hellal","year":"2013","unstructured":"Hellal A, Romdhane LB. Nodar: mining globally distributed substructures from a single labeled graph. J Intel Inf Syst. 2013; 40(1):1\u201315.","journal-title":"J Intel Inf Syst"},{"issue":"10","key":"181_CR66","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1016\/j.datak.2009.04.008","volume":"68","author":"X Jiang","year":"2009","unstructured":"Jiang X, Xiong H, Wang C, Tan A-H. Mining globally distributed frequent subgraphs in a single labeled graph. Data Knowl Eng. 2009; 68(10):1034\u201358.","journal-title":"Data Knowl Eng"},{"key":"181_CR67","unstructured":"W\u00f6rlein M, Dreweke A, Meinl T, Fischer I, Philippsen M. Edgar: the embedding-based graph miner. In: Proceedings of the International Workshop on Mining and Learning with Graphs : in Conjunction with ECML \/ PKDD, MLG \u201906: 2006. p. 1034\u201358."},{"key":"181_CR68","doi-asserted-by":"crossref","unstructured":"Ketkar NS, Holder LB, Cook DJ. Subdue: Compression-based frequent pattern discovery in graph data. In: Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations. OSDM \u201905: 2005. p. 71\u20136.","DOI":"10.1145\/1133905.1133915"},{"key":"181_CR69","doi-asserted-by":"crossref","unstructured":"Ghazizadeh S, Chawathe SS. Seus: Structure extraction using summaries. In: Proceedings of the 5th International Conference on Discovery Science. DS \u201902: 2002. p. 71\u201385.","DOI":"10.1007\/3-540-36182-0_9"},{"issue":"7","key":"181_CR70","doi-asserted-by":"publisher","first-page":"517","DOI":"10.14778\/2732286.2732289","volume":"7","author":"M Elseidy","year":"2014","unstructured":"Elseidy M, Abdelhamid E, Skiadopoulos S, Kalnis P. Grami: Frequent subgraph and pattern mining in a single large graph. Proc VLDB Endowment. 2014; 7(7):517\u201328.","journal-title":"Proc VLDB Endowment"},{"key":"181_CR71","doi-asserted-by":"crossref","unstructured":"Cule B, Goethals B, Hendrickx T. Mining interesting itemsets in graph datasets. In: Advances in Knowledge Discovery and Data Mining. 17th Pacific-Asia Conference, PAKDD 2013: 2013. p. 237\u201348.","DOI":"10.1007\/978-3-642-37453-1_20"},{"issue":"1","key":"181_CR72","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s10994-015-5539-3","volume":"105","author":"M van Leeuwen","year":"2016","unstructured":"van Leeuwen M, De Bie T, Spyropoulou E, Mesnage C. Subjective interestingness of subgraph patterns. Mach Learn. 2016; 105(1):41\u201375.","journal-title":"Mach Learn"},{"issue":"suppl 1","key":"181_CR73","first-page":"632","volume":"36","author":"C Su","year":"2008","unstructured":"Su C, Peregrin-Alvarez JM, Butland G, Phanse S, Fong V, Emili A, Parkinson J. Bacteriome.org\u2013an integrated protein interaction database for e. coli. Nucleic Acids Res. 2008; 36(suppl 1):632\u20136.","journal-title":"Nucleic Acids Res"},{"key":"181_CR74","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1093\/nar\/gkv1156","volume":"44","author":"S Gama-Castro","year":"2016","unstructured":"Gama-Castro S, Salgado H, Santos-Zavaleta A, Ledezma-Tejeida D, Mu\u00f1iz-Rascado L, Garc\u00eda-Sotelo JS, Alquicira-Hern\u00e1ndez K, Mart\u00ednez-Flores I, Pannier L, Castro-Mondrag\u00f3n JA, et al. RegulonDB version 9.0: high-level integration of gene regulation, coexpression, motif clustering and beyond. Nucleic Acids Res. 2016; 44:133\u201343.","journal-title":"Nucleic Acids Res"},{"issue":"D1","key":"181_CR75","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1093\/nar\/gkv1251","volume":"44","author":"M Moretto","year":"2016","unstructured":"Moretto M, Sonego P, Dierckxsens N, Brilli M, Bianco L, Ledezma-Tejeida D, Gama-Castro S, Galardini M, Romualdi C, Laukens K, et al. Colombos v3. 0: leveraging gene expression compendia for cross-species analyses. Nucleic Acids Res. 2016; 44(D1):620\u20133.","journal-title":"Nucleic Acids Res"},{"key":"181_CR76","unstructured":"Inokuchi A. AcGM. http:\/\/ist.ksc.kwansei.ac.jp\/~inokuchi\/acgm.zip . Accessed 24 Nov 2017."},{"key":"181_CR77","unstructured":"Karypis G. FSG. http:\/\/glaros.dtc.umn.edu\/gkhome\/pafi\/overview . Accessed 24 Nov 2017."},{"key":"181_CR78","unstructured":"Parmol. http:\/\/en.verysource.com\/parmol_1346_2006-08--100787.html . Accessed 24 Nov 2017."},{"key":"181_CR79","unstructured":"Borgelt C. MOSS. http:\/\/www.borgelt.net\/moss.html . Accessed 24 Nov 2017."},{"key":"181_CR80","unstructured":"Alon U. Mfinder. http:\/\/www.weizmann.ac.il\/mcb\/UriAlon\/download\/network-motif-software . Accessed 24 Nov 2017."},{"issue":"17","key":"181_CR81","doi-asserted-by":"publisher","first-page":"3572","DOI":"10.1093\/bioinformatics\/bti556","volume":"21","author":"F Schreiber","year":"2005","unstructured":"Schreiber F, Schw\u00f6bbermeyer H. Mavisto: a tool for the exploration of network motifs. Bioinformatics. 2005; 21(17):3572\u20134.","journal-title":"Bioinformatics"},{"key":"181_CR82","unstructured":"Schreiber F, Schw\u00f6bbermeyer H. MAVisto. http:\/\/mavisto.ipk-gatersleben.de\/ . Accessed 24 Nov 2017."},{"issue":"9","key":"181_CR83","doi-asserted-by":"publisher","first-page":"1152","DOI":"10.1093\/bioinformatics\/btl038","volume":"22","author":"S Wernicke","year":"2006","unstructured":"Wernicke S, Rasche F. Fanmod: a tool for fast network motif detection. Bioinformatics. 2006; 22(9):1152\u20133.","journal-title":"Bioinformatics"},{"key":"181_CR84","unstructured":"Wernicke S, Rasche F. FANMOD. http:\/\/theinf1.informatik.uni-jena.de\/motifs\/ . Accessed 24 Nov 2017."},{"key":"181_CR85","unstructured":"Kavosh. https:\/\/github.com\/shmohammadi86\/Kavosh . Accessed 24 Nov 2017."},{"key":"181_CR86","unstructured":"NetMODE. https:\/\/sourceforge.net\/projects\/netmode\/ . Accessed 24 Nov 2017."},{"key":"181_CR87","unstructured":"acc-Motif. http:\/\/www.ft.unicamp.br\/docentes\/meira\/accmotifs\/ . Accessed 24 Nov 2017."},{"key":"181_CR88","unstructured":"Meysman P. SSM. http:\/\/adrem.ua.ac.be\/sigsubgraph . Accessed 24 Nov 2017."}],"container-title":["BioData Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13040-018-0181-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13040-018-0181-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13040-018-0181-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T20:46:28Z","timestamp":1751834788000},"score":1,"resource":{"primary":{"URL":"https:\/\/biodatamining.biomedcentral.com\/articles\/10.1186\/s13040-018-0181-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,3]]},"references-count":88,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,12]]}},"alternative-id":["181"],"URL":"https:\/\/doi.org\/10.1186\/s13040-018-0181-9","relation":{},"ISSN":["1756-0381"],"issn-type":[{"value":"1756-0381","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,3]]},"assertion":[{"value":"19 December 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 September 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Not applicable.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare that they have no competing interest.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}},{"value":"Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Publisher\u2019s Note"}}],"article-number":"20"}}