{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:07:35Z","timestamp":1751688455586,"version":"3.41.0"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"S4","license":[{"start":{"date-parts":[[2018,5,1]],"date-time":"2018-05-01T00:00:00Z","timestamp":1525132800000},"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 Bioinformatics"],"published-print":{"date-parts":[[2018,5]]},"DOI":"10.1186\/s12859-018-2071-z","type":"journal-article","created":{"date-parts":[[2018,5,8]],"date-time":"2018-05-08T09:01:27Z","timestamp":1525770087000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["cmFSM: a scalable CPU-MIC coordinated drug-finding tool by frequent subgraph mining"],"prefix":"10.1186","volume":"19","author":[{"given":"Shunyun","family":"Yang","sequence":"first","affiliation":[]},{"given":"Runxin","family":"Guo","sequence":"additional","affiliation":[]},{"given":"Rui","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Xiangke","family":"Liao","sequence":"additional","affiliation":[]},{"given":"Quan","family":"Zou","sequence":"additional","affiliation":[]},{"given":"Benyun","family":"Shi","sequence":"additional","affiliation":[]},{"given":"Shaoliang","family":"Peng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,8]]},"reference":[{"issue":"1","key":"2071_CR1","first-page":"94","volume":"60","author":"BD Mckay","year":"2013","unstructured":"Mckay BD. Practical graph isomorphism. J Symb Comput. 2013;60(1):94\u2013112.","journal-title":"J Symb Comput"},{"unstructured":"Lin W. Efficient techniques for subgraph mining and query processing. Singapore: School of Computer Engineering, Nanyang Technological University; 2015.","key":"2071_CR2"},{"key":"2071_CR3","first-page":"581","volume-title":"SPIN: mining maximal frequent subgraphs from graph databases. Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"J Huan","year":"2004","unstructured":"Huan J, Wang W, Prins J, et al. SPIN: mining maximal frequent subgraphs from graph databases. Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Seattle, Washington, Usa: August, DBLP; 2004. p. 581\u20136."},{"issue":"10","key":"2071_CR4","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, et al. Mining globally distributed frequent subgraphs in a single labeled graph. Data Knowl Eng. 2009;68(10):1034\u201358.","journal-title":"Data Knowl Eng"},{"issue":"3","key":"2071_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10618-005-0003-9","volume":"11","author":"M Kuramochi","year":"2005","unstructured":"Kuramochi M, Karypis G. Finding frequent patterns in a large sparse graph. Data Min Knowl Disc. 2005;11(3):243\u201371.","journal-title":"Data Min Knowl Disc"},{"issue":"2","key":"2071_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/s10115-010-0305-0","volume":"27","author":"U Kang","year":"2011","unstructured":"Kang U, Tsourakakis CE, Faloutsos C. PEGASUS: mining peta-scale graphs. Knowl Inf Syst. 2011;27(2):303\u201325.","journal-title":"Knowl Inf Syst"},{"doi-asserted-by":"crossref","unstructured":"Reinhardt S, Karypis G. A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph. Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE international. IEEE; 2007. p. 1\u20138.","key":"2071_CR7","DOI":"10.1109\/IPDPS.2007.370404"},{"doi-asserted-by":"crossref","unstructured":"Wu B, Bai YL. An efficient distributed subgraph mining algorithm in extreme large graphs. Artificial Intelligence and Computational Intelligence - International Conference, Aici 2010, DBLP, Sanya, China, 2010:107\u2013115 October 23\u201324, 2010, Proceedings, .","key":"2071_CR8","DOI":"10.1007\/978-3-642-16530-6_14"},{"issue":"8","key":"2071_CR9","first-page":"1768","volume":"52","author":"Y Yan","year":"2015","unstructured":"Yan Y, Dong Y, He X, et al. FSMBUS: a frequent subgraph mining algorithm in single large-scale graph using spark. J Comput Res Dev. 2015;52(8):1768\u201383.","journal-title":"J Comput Res Dev"},{"doi-asserted-by":"crossref","unstructured":"Lin W, Xiao X, Xie X, et al. Network motif discovery: a GPU approach. IEEE, International Conference on Data Engineering IEEE. 2015. p. 831\u201342.","key":"2071_CR10","DOI":"10.1109\/ICDE.2015.7113337"},{"doi-asserted-by":"crossref","unstructured":"Hill S, Srichandan B, Sunderraman R. An iterative MapReduce approach to frequent subgraph mining in biological datasets. ACM Conference on Bioinformatics, Computational Biology and Biomedicine ACM. 2012. p. 661\u20136.","key":"2071_CR11","DOI":"10.1145\/2382936.2383055"},{"doi-asserted-by":"crossref","unstructured":"Inokuchi A, Washio T, Motoda H. An Apriori-based algorithm for mining frequent substructures from graph data. European conference on principles of data mining and knowledge discovery, London, UK. 2000;1910(1):13\u201323.","key":"2071_CR12","DOI":"10.1007\/3-540-45372-5_2"},{"doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G. Frequent subgraph discovery. IEEE International Conference on Data Mining IEEE Xplore. 2001:313\u201320.","key":"2071_CR13","DOI":"10.1109\/ICDM.2001.989534"},{"doi-asserted-by":"crossref","unstructured":"Meinl T, Fischer I, Philippsen M. A quantitative comparison of the subgraph miners mofa, gspan, FFSM, and gaston. European Conference on Principles and Practice of Knowledge Discovery in Databases Springer-Verlag. 2005:392\u2013403.","key":"2071_CR14","DOI":"10.1007\/11564126_39"},{"doi-asserted-by":"crossref","unstructured":"Borgelt C, Berthold MR. Mining Molecular Fragments: Finding Relevant Substructures of Molecules. IEEE International Conference on Data Mining, 2002. ICDM 2002. Proceedings. IEEE Xplore. 2002:51\u20138.","key":"2071_CR15","DOI":"10.1109\/ICDM.2002.1183885"},{"doi-asserted-by":"crossref","unstructured":"Huan J, Wang W, Prins J. Efficient mining of frequent subgraphs in the presence of isomorphism. IEEE International Conference on Data Mining IEEE. 2003:549\u201352.","key":"2071_CR16","DOI":"10.1145\/1014052.1014123"},{"unstructured":"Yan X, Han J. gSpan: graph-based substructure pattern mining. IEEE International Conference on Data Mining, 2002. ICDM 2002. Proceedings. IEEE Xplore. 2002:721\u20134.","key":"2071_CR17"},{"key":"2071_CR18","first-page":"647","volume-title":"A quickstart in frequent structure mining can make a difference. Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"S Nijssen","year":"2004","unstructured":"Nijssen S. A quickstart in frequent structure mining can make a difference. Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Seattle, Washington, Usa: August, DBLP; 2004. p. 647\u201352."},{"doi-asserted-by":"crossref","unstructured":"Yan X, Han J. CloseGraph: mining closed frequent graph patterns. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining: Washington, Dc, Usa, August DBLP; 2003. p. 286\u201395.","key":"2071_CR19","DOI":"10.1145\/956755.956784"},{"doi-asserted-by":"crossref","unstructured":"Maunz A, Helma C, Kramer S. Large-scale graph mining using backbone refinement classes. ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Paris, France, DBLP, 2009:617\u2013626 June 28 - July.","key":"2071_CR20","DOI":"10.1145\/1557019.1557089"},{"issue":"3","key":"2071_CR21","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1006\/jpdc.2000.1696","volume":"61","author":"DJ Cook","year":"2001","unstructured":"Cook DJ, Holder LB, Galal G, et al. Approaches to parallel graph-based knowledge discovery. J Parallel & Distributed Comput. 2001;61(3):427\u201346.","journal-title":"J Parallel & Distributed Comput"},{"doi-asserted-by":"crossref","unstructured":"Buehrer G, Parthasarathy S, Chen YK. Adaptive parallel graph mining for CMP architectures. International Conference on Data Mining IEEE Computer Society. 2006:97\u2013106.","key":"2071_CR22","DOI":"10.1109\/ICDM.2006.15"},{"key":"2071_CR23","first-page":"316","volume-title":"Scalable mining of large disk-based graph databases. Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"C Wang","year":"2004","unstructured":"Wang C, Wang W, Pei J, et al. Scalable mining of large disk-based graph databases. Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. Seattle, Washington, Usa: August DBLP; 2004. p. 316\u201325."},{"unstructured":"Nguyen SN, Orlowska ME, Li X. Graph mining based on a data partitioning approach. Nineteenth Conference on Australasian Database: Australian Computer Society, Inc; 2008. p. 31\u20137.","key":"2071_CR24"},{"key":"2071_CR25","first-page":"107","volume-title":"MapReduce: simplified data processing on large clusters. Conference on Symposium on Opearting Systems Design & Implementation","author":"J Dean","year":"2004","unstructured":"Dean J, Ghemawat S. MapReduce: simplified data processing on large clusters. Conference on Symposium on Opearting Systems Design & Implementation; 2004. p. 107\u201313."},{"issue":"3","key":"2071_CR26","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1109\/TKDE.2014.2345408","volume":"27","author":"MA Bhuiyan","year":"2013","unstructured":"Bhuiyan MA, Al HM. An iterative MapReduce based frequent subgraph mining algorithm. IEEE Transactions on Knowledge & Data Engineering. 2013;27(3):608\u201320.","journal-title":"IEEE Transactions on Knowledge & Data Engineering"},{"doi-asserted-by":"crossref","unstructured":"Lu W, Chen G, Tung AKH, et al. Efficiently extracting frequent subgraphs using MapReduce. IEEE International Conference on Big Data IEEE. 2013:639\u201347.","key":"2071_CR27","DOI":"10.1109\/BigData.2013.6691633"},{"doi-asserted-by":"crossref","unstructured":"Lin W, Xiao X, Ghinita G. Large-scale frequent subgraph mining in MapReduce. IEEE, International Conference on Data Engineering. IEEE. 2014:844\u201355.","key":"2071_CR28","DOI":"10.1109\/ICDE.2014.6816705"}],"container-title":["BMC Bioinformatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-018-2071-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s12859-018-2071-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s12859-018-2071-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T10:32:36Z","timestamp":1751625156000},"score":1,"resource":{"primary":{"URL":"https:\/\/bmcbioinformatics.biomedcentral.com\/articles\/10.1186\/s12859-018-2071-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5]]},"references-count":28,"journal-issue":{"issue":"S4","published-print":{"date-parts":[[2018,5]]}},"alternative-id":["2071"],"URL":"https:\/\/doi.org\/10.1186\/s12859-018-2071-z","relation":{},"ISSN":["1471-2105"],"issn-type":[{"type":"electronic","value":"1471-2105"}],"subject":[],"published":{"date-parts":[[2018,5]]},"assertion":[{"value":"8 May 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":"98"}}