{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:38:33Z","timestamp":1725489513984},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540733898"},{"type":"electronic","value":"9783540733904"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73390-4_20","type":"book-chapter","created":{"date-parts":[[2007,8,18]],"date-time":"2007-08-18T04:56:05Z","timestamp":1187412965000},"page":"180-184","source":"Crossref","is-referenced-by-count":0,"title":["A Method of Improving the Efficiency of Mining Sub-structures in Molecular Structure Databases"],"prefix":"10.1007","author":[{"given":"Haibo","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuanzhen","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"L\u00fc","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/3-540-45372-5_2","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"A. Inokuchi","year":"2000","unstructured":"Inokuchi, A., Washio, T., Motoda, H.: An apriori-based algorithm for mining frequent substructures from graph data. In: Zighed, A.D.A., Komorowski, J., \u017bytkow, J.M. (eds.) PKDD 2000. LNCS (LNAI), vol.\u00a01910, pp. 13\u201323. Springer, Heidelberg (2000)"},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Kuramochi, M., Karypis, G.: Frequent subgraph discovery. In: Proc. 2001 Int. Conf. Data Mining (ICDM 2001), San Jose, CA (November 2001)","DOI":"10.1109\/ICDM.2001.989534"},{"key":"20_CR3","unstructured":"National Cancer Institute (NCI). Dtp\/2d and 3d structural information (1999), \n                    \n                      http:\/\/cactus.nci.nih.gov\/ncidb2\/download.html"},{"key":"20_CR4","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Kok, J.N.: A quickstart in frequent structure mining can make a difference. In: Proceedings of the 10th ACM SIGKDD International Conference on knowledge Discovery and Data Mining (KDD 2004), Seattle, USA (August 2004)","DOI":"10.1145\/1014052.1014134"},{"key":"20_CR5","unstructured":"Yan, X., Han, J.: gSpan: Graph-based substructure pattern mining. In UIUC-CS Tech. Report: R-2002-2296, A short version published. In: Proc. 2002 Int. Conf. Data Mining(ICDM 2002), Maebashi, Japan (2002)"}],"container-title":["Lecture Notes in Computer Science","Data Management. Data, Data Everywhere"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73390-4_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:09:37Z","timestamp":1619503777000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73390-4_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540733898","9783540733904"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73390-4_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}