{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:17:06Z","timestamp":1775873826351,"version":"3.50.1"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,1,15]],"date-time":"2019-01-15T00:00:00Z","timestamp":1547510400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100011102","name":"European Union Seventh Framework Programme","doi-asserted-by":"crossref","award":["European Research Council Advanced Grant Agreement 322739-DOUBLEUP"],"award-info":[{"award-number":["European Research Council Advanced Grant Agreement 322739-DOUBLEUP"]}],"id":[{"id":"10.13039\/100011102","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Ghent University - imec"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Bioinformatics"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1186\/s12859-018-2483-9","type":"journal-article","created":{"date-parts":[[2019,1,15]],"date-time":"2019-01-15T08:02:52Z","timestamp":1547539372000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Optimising orbit counting of arbitrary order by equation selection"],"prefix":"10.1186","volume":"20","author":[{"given":"Ine","family":"Melckenbeeck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pieter","family":"Audenaert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Van Parys","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yves","family":"Van De Peer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Didier","family":"Colle","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Pickavet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,1,15]]},"reference":[{"issue":"5594","key":"2483_CR1","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 (New York, N.Y.) 2002; 298(5594):824\u20137.","journal-title":"Science (New York, N.Y.)"},{"issue":"9","key":"2483_CR2","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 (Oxford, England). 2006; 22(9):1152\u20133.","journal-title":"Bioinformatics (Oxford, England)"},{"key":"2483_CR3","doi-asserted-by":"crossref","unstructured":"Lin W, Xiao X, Xie X, Li X-lL. Network motif discovery: A GPU approach. In: 2015 IEEE 31st International Conference on Data Engineering. IEEE: 2015. p. 831\u201342.","DOI":"10.1109\/ICDE.2015.7113337"},{"issue":"18","key":"2483_CR4","doi-asserted-by":"publisher","first-page":"3508","DOI":"10.1093\/bioinformatics\/bth436","volume":"20","author":"N Pr\u017eulj","year":"2004","unstructured":"Pr\u017eulj N, Corneil DG, Jurisica I. Modeling interactome: scale-free or geometric?Bioinformatics (Oxford, England). 2004; 20(18):3508\u201315.","journal-title":"Bioinformatics (Oxford, England)"},{"issue":"1372","key":"2483_CR5","first-page":"758","volume":"34","author":"I Melckenbeeck","year":"2017","unstructured":"Melckenbeeck I, Audenaert P, Colle D, Pickavet M. Efficiently counting all orbits of graphlets of any order in a graph using autogenerated equations. Bioinformatics (Oxford, England). 2017; 34(1372):758.","journal-title":"Bioinformatics (Oxford, England)"},{"issue":"8","key":"2483_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0181570","volume":"12","author":"A Hasan","year":"2017","unstructured":"Hasan A, Chung PC, Hayes W. Graphettes: Constant-time determination of graphlet and orbit identity including (possibly disconnected) graphlets up to size 8. PLoS ONE. 2017; 12(8):1\u201312.","journal-title":"PLoS ONE"},{"issue":"2","key":"2483_CR7","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 (Oxford, England). 2007; 23(2):177\u201383.","journal-title":"Bioinformatics (Oxford, England)"},{"key":"2483_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.4137\/CIN.S680","volume":"6","author":"T Milenkovi\u0107","year":"2008","unstructured":"Milenkovi\u0107 T, Pr\u017eulj N. Uncovering biological network function via graphlet degree signatures. Cancer Informat. 2008; 6:257\u201373.","journal-title":"Cancer Informat"},{"issue":"4","key":"2483_CR9","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1093\/bioinformatics\/btt717","volume":"30","author":"T Ho\u010devar","year":"2014","unstructured":"Ho\u010devar T, Dem\u0161ar J. A combinatorial approach to graphlet counting. Bioinformatics (Oxford, England). 2014; 30(4):559\u201365.","journal-title":"Bioinformatics (Oxford, England)"},{"issue":"1","key":"2483_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0147078","volume":"11","author":"I Melckenbeeck","year":"2016","unstructured":"Melckenbeeck I, Audenaert P, Michoel T, Colle D, Pickavet M. An Algorithm to Automatically Generate the Combinatorial Orbit Counting Equations. PLoS ONE. 2016; 11(1):1\u201319.","journal-title":"PLoS ONE"},{"key":"2483_CR11","volume-title":"Proceedings of the 26th International Conference on World Wide Web","author":"A Pinar","year":"2017","unstructured":"Pinar A, Seshadhri C, Vishal V. ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. In: Proceedings of the 26th International Conference on World Wide WebSwitzerland: International World Wide Web Conferences Steering Committee Republic and Canton of Geneva: 2017. p. 1431\u201340."},{"issue":"4","key":"2483_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1371\/journal.pone.0195997","volume":"13","author":"R Cannoodt","year":"2018","unstructured":"Cannoodt R, Ruyssinck J, Ramon J, De Preter K, Saeys Y. IncGraph: Incremental graphlet counting for topology optimisation. PLoS ONE. 2018; 13(4):1\u201311.","journal-title":"PLoS ONE"},{"key":"2483_CR13","first-page":"290","volume":"6","author":"P Erdo\u030bs","year":"1959","unstructured":"Erdo\u030bs P, R\u00e9nyi A. On random graphs I. Publ Math. 1959; 6:290\u20137.","journal-title":"Publ Math"},{"key":"2483_CR14","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/S0378-4371(99)00291-5","volume":"272","author":"A-L Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si A-L, Albert R, Jeong H. Mean-field theory for scale-free random networks. Physica A Stat Mech Appl. 1999; 272:173\u201387.","journal-title":"Physica A Stat Mech Appl"},{"issue":"6","key":"2483_CR15","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1017\/S0963548300004454","volume":"9","author":"J D\u00edaz","year":"2000","unstructured":"D\u00edaz J, Penrose MD, Petit J, Serna M. Convergence Theorems for Some Layout Measures on Random Lattice and Random Geometric Graphs. Comb Probab Comput. 2000; 9(6):489\u2013511.","journal-title":"Comb Probab Comput"},{"issue":"D1","key":"2483_CR16","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1093\/nar\/gkt1115","volume":"42","author":"S Orchard","year":"2014","unstructured":"Orchard S, Ammari M, Aranda B, Breuza L, Briganti L, Broackes-Carter F, Campbell NH, Chavali G, Chen C, Del-Toro N, Duesbury M, Dumousseau M, Galeota E, Hinz U, Iannuccelli M, Jagannathan S, Jimenez R, Khadake J, Lagreid A, Licata L, Lovering RC, Meldal B, Melidoni AN, Milagros M, Peluso D, Perfetto L, Porras P, Raghunath A, Ricard-Blum S, Roechert B, Stutz A, Tognolli M, Van Roey K, Cesareni G, Hermjakob H. The MIntAct project - IntAct as a common curation platform for 11 molecular interaction databases. Nucleic Acids Res. 2014; 42(D1):358\u201363.","journal-title":"Nucleic Acids Res"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-018-2483-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-018-2483-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-018-2483-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,3]],"date-time":"2020-02-03T09:09:44Z","timestamp":1580720984000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-018-2483-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,15]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["2483"],"URL":"https:\/\/doi.org\/10.1186\/s12859-018-2483-9","relation":{},"ISSN":["1471-2105"],"issn-type":[{"value":"1471-2105","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,15]]},"assertion":[{"value":"20 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 November 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2019","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 interests.","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":"27"}}