{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:14:32Z","timestamp":1764688472302},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540290315"},{"type":"electronic","value":"9783540320791"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11557654_97","type":"book-chapter","created":{"date-parts":[[2005,10,4]],"date-time":"2005-10-04T13:59:18Z","timestamp":1128434358000},"page":"866-877","source":"Crossref","is-referenced-by-count":9,"title":["High Performance Subgraph Mining in Molecular Compounds"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Di Fatta","sequence":"first","affiliation":[]},{"given":"Michael R.","family":"Berthold","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"97_CR1","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. ACM SIGKDD Explorations Newsletter\u00a05, 59\u201368 (2003)","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"97_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD International Conference on Management of Data, Washington, D.C., pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"97_CR3","unstructured":"Zaki, M., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proceedings of 3rd Int. Conf. on Knowledge Discovery and Data Mining (KDD 1997), pp. 283\u2013296 (1997)"},{"key":"97_CR4","doi-asserted-by":"crossref","unstructured":"Deshpande, M., Kuramochi, M., Karypis, G.: Frequent sub-structure-based approaches for classifying chemical compounds. In: Proceedings of IEEE International Conference on Data Mining (ICDM 2003), Melbourne, Florida, USA (2003)","DOI":"10.21236\/ADA439580"},{"key":"97_CR5","doi-asserted-by":"crossref","unstructured":"Deshpande, M., Kuramochi, M., Karypis, G.: Automated approaches for classifying structures. In: Proceedings of Workshop on Data Mining in Bioinformatics (BioKDD), pp. 11\u201318 (2002)","DOI":"10.21236\/ADA439498"},{"key":"97_CR6","unstructured":"Yan, X., Han, J.: gSpan: Graph-Based Substructure Pattern Mining. In: Proc. of the IEEE Int. Conference on Data Mining, Maebashi City, Japan (2002)"},{"key":"97_CR7","doi-asserted-by":"crossref","unstructured":"Borgelt, C., Berthold, M.R.: Mining molecular fragments: Finding relevant substructures of molecules. In: IEEE International Conference on Data Mining (ICDM 2002), Maebashi, Japan, pp. 51\u201358 (2002)","DOI":"10.1109\/ICDM.2002.1183885"},{"key":"97_CR8","doi-asserted-by":"crossref","unstructured":"Kramer, S., de Raedt, L., Helma, C.: Molecular feature mining in hiv data. In: Proceedings of 7th Int. Conf. on Knowledge Discovery and Data Mining (KDD 2001), San Francisco, CA, pp. 136\u2013143 (2001)","DOI":"10.1145\/502512.502533"},{"key":"97_CR9","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1109\/4434.806975","volume":"7","author":"M.J. Zaki","year":"1999","unstructured":"Zaki, M.J.: Parallel and distributed association mining: A survey. IEEE Concurrency\u00a07, 14\u201325 (1999)","journal-title":"IEEE Concurrency"},{"key":"97_CR10","unstructured":"Di Fatta, G., Berthold, M.R.: Distributed mining of molecular fragments. In: IEEE DM-Grid Workshop of the Int. Conf. on Data Mining, Brighton, UK (2004)"},{"key":"97_CR11","doi-asserted-by":"crossref","unstructured":"Wang, C., Parthasarathy, S.: Parallel algorithms for mining frequent structural motifs in scientific data. In: Proceedings of the 18th Annual International Conference on Supercomputing (ICS 2004), Saint Malo, France, June 26 - July 01 (2004)","DOI":"10.1145\/1006209.1006215"},{"issue":"2","key":"97_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1145\/22719.24067","volume":"9","author":"R. Finkel","year":"1987","unstructured":"Finkel, R., Manber, U.: DIB - a distributed implementation of backtracking. ACM Transactions on Programming Languages and Systems\u00a09(2), 235\u2013256 (1987)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"97_CR13","unstructured":"Daylight Chemical Information Systems, Inc.: SMILES - Simplified Molecular Input Line Entry Specification, \n                    \n                      http:\/\/www.daylight.com\/smiles"},{"key":"97_CR14","doi-asserted-by":"crossref","unstructured":"Karp, R., Zhang, Y.: A randomized parallel branch-and-bound procedure. In: Proceedings of the 20 Annual ACM Symposium on Theory of Computing (STOC 1988), pp. 290\u2013300 (1988)","DOI":"10.1145\/62212.62240"},{"key":"97_CR15","doi-asserted-by":"crossref","unstructured":"Chakrabarti, S., Ranade, A., Yelick, K.: Randomized load-balancing for tree-structured computation. In: Proceedings of the Scalable High Performance Computing Conference (SHPCC 1994), Knoxville, TN, pp. 666\u2013673 (1994)","DOI":"10.1109\/SHPCC.1994.296705"},{"key":"97_CR16","doi-asserted-by":"publisher","first-page":"346","DOI":"10.4218\/etrij.98.0198.0403","volume":"20","author":"Y. Chung","year":"1998","unstructured":"Chung, Y., Park, J., Yoon, S.: An asynchronous algorithm for balancing unpredictable workload on distributed-memory machines. ETRI Journal\u00a020, 346\u2013360 (1998)","journal-title":"ETRI Journal"},{"key":"97_CR17","doi-asserted-by":"publisher","first-page":"577","DOI":"10.1093\/jnci\/81.8.577","volume":"81","author":"O. Weislow","year":"1989","unstructured":"Weislow, O., Kiser, R., Fine, D., Bader, J., Shoemaker, R., Boyd, M.: New soluble formazan assay for hiv-1 cytopathic effects: Application to high flux screening of synthetic and natural products for aids antiviral activity. Journal of the National Cancer Institute\u00a081, 577\u2013586 (1989)","journal-title":"Journal of the National Cancer Institute"}],"container-title":["Lecture Notes in Computer Science","High Performance Computing and Communications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11557654_97","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T03:01:23Z","timestamp":1552446083000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11557654_97"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290315","9783540320791"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11557654_97","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}