{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T17:09:24Z","timestamp":1725988164928},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319987019"},{"type":"electronic","value":"9783319987026"}],"license":[{"start":{"date-parts":[[2018,8,17]],"date-time":"2018-08-17T00:00:00Z","timestamp":1534464000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-319-98702-6_16","type":"book-chapter","created":{"date-parts":[[2018,8,16]],"date-time":"2018-08-16T05:27:55Z","timestamp":1534397275000},"page":"131-138","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Simple Pattern-only Heuristics Lead to Fast Subgraph Matching Strategies on Very Large Networks"],"prefix":"10.1007","author":[{"given":"Antonino","family":"Aparo","sequence":"first","affiliation":[]},{"given":"Vincenzo","family":"Bonnici","sequence":"additional","affiliation":[]},{"given":"Giovanni","family":"Micale","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Ferro","sequence":"additional","affiliation":[]},{"given":"Dennis","family":"Shasha","sequence":"additional","affiliation":[]},{"given":"Alfredo","family":"Pulvirenti","sequence":"additional","affiliation":[]},{"given":"Rosalba","family":"Giugno","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,8,17]]},"reference":[{"key":"16_CR1","doi-asserted-by":"crossref","unstructured":"Bonnici, V., Busato, F., Micale, G., Bombieri, N., Pulvirenti, A., Giugno, R.: Appagato: An approximate parallel and stochastic graph querying tool for biological networks. Bioinformatics 32(14), 2159\u20132166 (2016). Cited by: 2","DOI":"10.1093\/bioinformatics\/btw223"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1109\/TCBB.2016.2515595","volume":"14","author":"V Bonnici","year":"2017","unstructured":"Bonnici, V., Giugno, R.: On the variable ordering in subgraph isomorphism algorithms. IEEE\/ACM Trans. Comput. Biol. Bioinf. 14(1), 193\u2013203 (2017)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinf."},{"issue":"Suppl 7","key":"16_CR3","doi-asserted-by":"publisher","first-page":"S13","DOI":"10.1186\/1471-2105-14-S7-S13","volume":"14","author":"V Bonnici","year":"2013","unstructured":"Bonnici, V., Giugno, R., Pulvirenti, A., Shasha, D., Ferro, A.: A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinf. 14(Suppl 7), S13 (2013)","journal-title":"BMC Bioinf."},{"issue":"99","key":"16_CR4","first-page":"1","volume":"PP","author":"V Carletti","year":"2017","unstructured":"Carletti, V., Foggia, P., Saggese, A., Vento, M.: Challenging the time complexity of exact subgraph isomorphism for huge and dense graphs with vf3. IEEE Trans. Pattern Anal. Mach. Intell. PP(99), 1 (2017)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"Giugno, R., Bonnici, V., Bombieri, N., Pulvirenti, A., Ferro, A., Shasha, D.: Grapes: a software for parallel searching on biological graphs targeting multi-core architectures. PLoS ONE 8(10) (2013). Cited by: 10","DOI":"10.1371\/journal.pone.0076911"},{"issue":"3","key":"16_CR6","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"RM Haralick","year":"1980","unstructured":"Haralick, R.M., Elliott, G.L.: Increasing tree search efficiency for constraint satisfaction problems. Artif. Intell. 14(3), 263\u2013313 (1980)","journal-title":"Artif. Intell."},{"issue":"3","key":"16_CR7","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0020-0255(79)90023-9","volume":"19","author":"J McGregor","year":"1979","unstructured":"McGregor, J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inf. Sci. 19(3), 229\u2013250 (1979)","journal-title":"Inf. Sci."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1007\/s10618-017-0544-8","volume":"32","author":"G Micale","year":"2017","unstructured":"Micale, G., Giugno, R., Ferro, A., Mongiov\u00ec, M., Shasha, D., Pulvirenti, A.: Fast analytical methods for finding significant labeled graph motifs. Data Min. Knowl. Discov. 32, 504\u2013531 (2017)","journal-title":"Data Min. Knowl. Discov."},{"key":"16_CR9","first-page":"90","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"RG Michael","year":"1979","unstructured":"Michael, R.G., David, S.J.: Computers and Intractability: A Guide to the Theory of NP-Completeness, pp. 90\u201391. WH Free. Co., San Francisco (1979)"},{"issue":"5594","key":"16_CR10","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 298(5594), 824\u2013827 (2002)","journal-title":"Science"},{"key":"16_CR11","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1038\/nchembio.462","volume":"6","author":"B Palsson","year":"2010","unstructured":"Palsson, B., Zengler, K.: The challenges of integrating multi-omic data sets. Nat. Chem. Biol. 6, 787\u2013789 (2010)","journal-title":"Nat. Chem. Biol."},{"issue":"12","key":"16_CR12","doi-asserted-by":"publisher","first-page":"850","DOI":"10.1016\/j.artint.2010.05.002","volume":"174","author":"C Solnon","year":"2010","unstructured":"Solnon, C.: Alldifferent-based filtering for subgraph isomorphism. Artif. Intell. 174(12), 850\u2013864 (2010)","journal-title":"Artif. Intell."},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Ullmann, J.R.: Bit-vector algorithms for binary constraint satisfaction and subgraph isomorphism. J. Exp. Algorithmics 15, 1.6:1.1-1.6:1.64 (2011)","DOI":"10.1145\/1671970.1921702"}],"container-title":["Advances in Intelligent Systems and Computing","Practical Applications of Computational Biology and Bioinformatics, 12th International Conference"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98702-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T07:05:38Z","timestamp":1571727938000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98702-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,17]]},"ISBN":["9783319987019","9783319987026"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98702-6_16","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2018,8,17]]}}}