{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T04:09:07Z","timestamp":1751602147016,"version":"3.41.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"S1","license":[{"start":{"date-parts":[[2018,4,1]],"date-time":"2018-04-01T00:00:00Z","timestamp":1522540800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["BMC Syst Biol"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1186\/s12918-018-0533-6","type":"journal-article","created":{"date-parts":[[2018,4,11]],"date-time":"2018-04-11T10:26:12Z","timestamp":1523442372000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Counting motifs in dynamic networks"],"prefix":"10.1186","volume":"12","author":[{"given":"Kingshuk","family":"Mukherjee","sequence":"first","affiliation":[]},{"given":"Md Mahmudul","family":"Hasan","sequence":"additional","affiliation":[]},{"given":"Christina","family":"Boucher","sequence":"additional","affiliation":[]},{"given":"Tamer","family":"Kahveci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,4,11]]},"reference":[{"key":"533_CR1","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1038\/35011540","volume":"402","author":"LH Hartwell","year":"1999","unstructured":"Hartwell LH, Hopfield JJ, Leibler S, Murray AW. From molecular to modular cell biology. Nature. 1999; 402:47\u201352.","journal-title":"Nature"},{"issue":"7","key":"533_CR2","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1089\/cmb.2007.0172","volume":"15","author":"B Dost","year":"2008","unstructured":"Dost B, et al. QNet: A tool for querying protein interaction networks. J Comp Biol. 2008; 15(7):913\u201325.","journal-title":"J Comp Biol"},{"issue":"1","key":"533_CR3","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1186\/s12859-015-0756-0","volume":"16","author":"MM Hasan","year":"2015","unstructured":"Hasan MM, Kahveci T. Indexing a protein-protein interaction network expedites network alignment. BMC Bioinformatics. 2015; 16(1):326.","journal-title":"BMC Bioinformatics"},{"issue":"11","key":"533_CR4","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1016\/j.tim.2005.09.001","volume":"13","author":"C Francke","year":"2005","unstructured":"Francke C, Siezen RJ, Teusink B. Reconstructing the metabolic network of a bacterium from its genome. Trends Microbiol. 2005; 13(11):550\u20138.","journal-title":"Trends Microbiol"},{"key":"533_CR5","doi-asserted-by":"crossref","unstructured":"Sridhar P, Kahveci T, Ranka S. An iterative algorithm for metabolic network-based drug target identification. Pac Symp Biocomput. 2007;:88\u201399.","DOI":"10.1142\/9789812772435_0009"},{"issue":"5594","key":"533_CR6","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1126\/science.298.5594.824","volume":"298","author":"R Milo","year":"2002","unstructured":"Milo R, et al. Network motifs: simple building blocks of complex networks. Science. 2002; 298(5594):824\u20137.","journal-title":"Science"},{"key":"533_CR7","volume-title":"Workshop on Algorithms in Bioinformatics","author":"S Wernicke","year":"2005","unstructured":"Wernicke S. A faster algorithm for detecting network motifs. In: Workshop on Algorithms in Bioinformatics. Berlin, Heidelberg: Springer: 2005. p. 165\u201377."},{"issue":"1","key":"533_CR8","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1186\/1471-2105-9-70","volume":"9","author":"T Milenkovi\u0107","year":"2008","unstructured":"Milenkovi\u0107 T, Lai J, Pr\u017eulj N. GraphCrunch: a tool for large network analyses. BMC Bioinformatics. 2008; 9(1):70.","journal-title":"BMC Bioinformatics"},{"key":"533_CR9","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS. Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: W. H. Freeman & Co.; 1979."},{"key":"533_CR10","volume-title":"Proceedings of the Third Annual ACM Symposium on Theory of Computing. STOC \u201971","author":"SA Cook","year":"1971","unstructured":"Cook SA. The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing. STOC \u201971. New York: ACM: 1971. p. 151\u20138."},{"key":"533_CR11","volume-title":"Research in Computational Molecular Biology","author":"JA Grochow","year":"2007","unstructured":"Grochow JA, Kellis M. Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking. In: Research in Computational Molecular Biology. Berlin, Heidelberg: Springer: 2007. p. 92\u2013106."},{"issue":"11","key":"533_CR12","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\u20131758.","journal-title":"Bioinformatics"},{"key":"533_CR13","doi-asserted-by":"crossref","unstructured":"Omidi S, Schreiber F, Masoudi-Nejad A. Moda: An efficient algorithm for network motif discovery in biological networks. Genes Genet Syst. 2009; 84(5):385\u201395. http:\/\/doi.org\/10.1266\/ggs.84.385 .","DOI":"10.1266\/ggs.84.385"},{"issue":"4","key":"533_CR14","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1109\/TCBB.2006.51","volume":"3","author":"S Wernicke","year":"2006","unstructured":"Wernicke S. Efficient detection of network motifs. IEEE\/ACM Trans Comput Biol Bioinfo. 2006; 3(4):347\u201359.","journal-title":"IEEE\/ACM Trans Comput Biol Bioinfo"},{"key":"533_CR15","doi-asserted-by":"crossref","unstructured":"Chen J, Hsu W, Lee ML, Ng S. NeMoFinder: Dissecting genome-wide protein-protein interactions with meso-scale network motifs. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, vol. 2006: 2006. p. 106\u201315.","DOI":"10.1145\/1150402.1150418"},{"issue":"1","key":"533_CR16","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1186\/1471-2105-10-318","volume":"10","author":"ZRM Kashani","year":"2009","unstructured":"Kashani ZRM, et al. Kavosh: a new algorithm for finding network motifs. BMC Bioinformatics. 2009; 10(1):318.","journal-title":"BMC Bioinformatics"},{"key":"533_CR17","doi-asserted-by":"crossref","unstructured":"Elhesha R, Kahveci T. Identification of large disjoint motifs in biological networks. BMC Bioinformatics. 2016; 17(1):408. http:\/\/doi.org\/10.1186\/s12859-016-1271-7 .","DOI":"10.1186\/s12859-016-1271-7"},{"key":"533_CR18","volume-title":"Transactions on Computational Systems Biology III","author":"F Schreiber","year":"2005","unstructured":"Schreiber F, Schw\u00f6bbermeyer H. Frequency concepts and pattern detection for the analysis of motifs in networks. In: Transactions on Computational Systems Biology III. Berlin, Heidelberg: Springer: 2005. p. 89\u2013104."},{"issue":"1","key":"533_CR19","first-page":"231","volume":"1","author":"DJ Cook","year":"1994","unstructured":"Cook DJ, Holder LB. Substructure discovery using minimum description length and background knowledge. J Artif Int Res. 1994; 1(1):231\u201355.","journal-title":"J Artif Int Res"},{"key":"533_CR20","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G. GREW - a scalable frequent subgraph discovery algorithm. In: Fourth IEEE International Conference on Data Mining, 2004. ICDM \u201904: 2004. p. 439\u201342.","DOI":"10.1109\/ICDM.2004.10024"},{"key":"533_CR21","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:1038\u201351.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"533_CR22","unstructured":"Yan X, Han J. gSpan: Graph-based substructure pattern mining. In: IEEE International Conference on Data Mining, 2002. ICDM \u201902: 2002. p. 721\u20134."},{"key":"533_CR23","volume-title":"Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201904","author":"J Huan","year":"2004","unstructured":"Huan J, Wang W, Prins J. SPIN: mining maximal frequent subgraphs from graph databases. In: Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. KDD \u201904. New York: ACM: 2004. p. 581\u20136."},{"key":"533_CR24","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1093\/bioinformatics\/bti1049","volume":"21","author":"H Hu","year":"2005","unstructured":"Hu H, et al. Mining coherent dense subgraphs across massive biological networks for discovery. Bioinformatics. 2005; 21:213\u201321.","journal-title":"Bioinformatics"},{"key":"533_CR25","doi-asserted-by":"crossref","unstructured":"Ranu S, Singh AK. GraphSig: A scalable approach to mining significant subgraphs in large graph databases. In: 2009 IEEE 25th International Conference on Data Engineering: 2009. p. 844\u201355.","DOI":"10.1109\/ICDE.2009.133"},{"key":"533_CR26","volume-title":"ACM BCB","author":"MM Hasan","year":"2013","unstructured":"Hasan MM, Kahveci T. Color distribution can accelerate network alignment. In: ACM BCB. New York: ACM: 2013. p. 52\u201361."},{"key":"533_CR27","volume-title":"Proceedings of the eighth workshop on mining and learning with graphs. MLG \u201910","author":"B Wackersreuther","year":"2010","unstructured":"Wackersreuther B, et al. Frequent subgraph discovery in dynamic networks. In: Proceedings of the eighth workshop on mining and learning with graphs. MLG \u201910. New York: ACM: 2010. p. 155\u201362."},{"issue":"1","key":"533_CR28","first-page":"46","volume":"8","author":"G Qin","year":"2013","unstructured":"Qin G, Gao L, Yang J. Significant substructure discovery in dynamic networks. Curr Bioinform. 2013; 8(1):46\u201355.","journal-title":"Curr Bioinform"},{"key":"533_CR29","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","volume":"6","author":"P Erdo\u030bs","year":"1959","unstructured":"Erdo\u030bs P, R\u00e9nyi A. On random graphs. I. Publ Math Debrecen. 1959; 6:290\u20137.","journal-title":"Publ Math Debrecen"},{"key":"533_CR30","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts DJ, Strogatz SH. Collective dynamics of\u2019small-world\u2019networks. Nature. 1998; 393:409\u201310.","journal-title":"Nature"},{"key":"533_CR31","doi-asserted-by":"crossref","unstructured":"Barab\u00e1si AL, Albert R. Emergence of scaling in random networks. Science. 1999; 286(5439):509\u201312. https:\/\/doi.org\/10.1126\/science.286.5439.509 .","DOI":"10.1126\/science.286.5439.509"},{"issue":"8","key":"533_CR32","doi-asserted-by":"publisher","first-page":"1091","DOI":"10.1101\/gr.187989.114","volume":"25","author":"JC Rivera-Mulia","year":"2015","unstructured":"Rivera-Mulia JC, et al. Dynamic changes in replication timing and gene expression during human development. Genome Res. 2015; 25(8):1091\u2013103.","journal-title":"Genome Res"},{"key":"533_CR33","unstructured":"Milo R, et al. On the uniform generation of random graphs with prescribed degree sequences. 2003. Arxiv preprint cond-mat\/0312028."}],"container-title":["BMC Systems Biology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12918-018-0533-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12918-018-0533-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12918-018-0533-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T15:43:40Z","timestamp":1751557420000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcsystbiol.biomedcentral.com\/articles\/10.1186\/s12918-018-0533-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4]]},"references-count":33,"journal-issue":{"issue":"S1","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["533"],"URL":"https:\/\/doi.org\/10.1186\/s12918-018-0533-6","relation":{},"ISSN":["1752-0509"],"issn-type":[{"type":"electronic","value":"1752-0509"}],"subject":[],"published":{"date-parts":[[2018,4]]},"assertion":[{"value":"11 April 2018","order":1,"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":"6"}}