{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,31]],"date-time":"2026-01-31T06:51:56Z","timestamp":1769842316220,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":14,"publisher":"ACM","license":[{"start":{"date-parts":[[2004,8,22]],"date-time":"2004-08-22T00:00:00Z","timestamp":1093132800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2004,8,22]]},"DOI":"10.1145\/1014052.1014134","type":"proceedings-article","created":{"date-parts":[[2004,10,7]],"date-time":"2004-10-07T17:39:48Z","timestamp":1097170788000},"page":"647-652","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":286,"title":["A quickstart in frequent structure mining can make a difference"],"prefix":"10.1145","author":[{"given":"Siegfried","family":"Nijssen","sequence":"first","affiliation":[{"name":"Universiteit Leiden, Leiden, The Netherlands"}]},{"given":"Joost N.","family":"Kok","sequence":"additional","affiliation":[{"name":"Universiteit Leiden, Leiden, The Netherlands"}]}],"member":"320","published-online":{"date-parts":[[2004,8,22]]},"reference":[{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/998688.1007091"},{"key":"e_1_3_2_1_3_1","first-page":"30","volume-title":"Proceedings of the SIGKDD","author":"Dehaspe L.","year":"1998","unstructured":"L. Dehaspe , H. Toivonen , and R. D. King . Finding frequent substructures in chemical compounds . In Proceedings of the SIGKDD , pages 30 -- 36 , 1998 . L. Dehaspe, H. Toivonen, and R. D. King. Finding frequent substructures in chemical compounds. In Proceedings of the SIGKDD, pages 30--36, 1998."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1293797.1293803"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952101"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021726221443"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/645496.658027"},{"key":"e_1_3_2_1_8_1","volume-title":"Practical graph isomorphism. 30:45--87","author":"McKay B. D.","year":"1981","unstructured":"B. D. McKay . Practical graph isomorphism. 30:45--87 , 1981 . B. D. McKay. Practical graph isomorphism. 30:45--87, 1981."},{"key":"e_1_3_2_1_9_1","volume-title":"IPSJ SIGNotes ALgorithms, number 091--002","author":"Nakano S.","year":"2003","unstructured":"S. Nakano and T. Uno . A simple constant time enumeration algorithm for free trees . In IPSJ SIGNotes ALgorithms, number 091--002 , 2003 . S. Nakano and T. Uno. A simple constant time enumeration algorithm for free trees. In IPSJ SIGNotes ALgorithms, number 091--002, 2003."},{"key":"e_1_3_2_1_10_1","volume-title":"http:\/\/cactus.nci.nih.gov\/ncidb2\/download.html","author":"National Cancer Institute (NCI). DTP\/2D and 3D structural information","year":"1999","unstructured":"National Cancer Institute (NCI). DTP\/2D and 3D structural information , http:\/\/cactus.nci.nih.gov\/ncidb2\/download.html . 1999 . National Cancer Institute (NCI). DTP\/2D and 3D structural information, http:\/\/cactus.nci.nih.gov\/ncidb2\/download.html. 1999."},{"key":"e_1_3_2_1_11_1","first-page":"55","volume-title":"First International Workshop on Mining Graphs, Trees and Sequences","author":"Nijssen S.","year":"2003","unstructured":"S. Nijssen and J. N. Kok . Efficient discovery of frequent unordered trees . In First International Workshop on Mining Graphs, Trees and Sequences , pages 55 -- 64 , 2003 . S. Nijssen and J. N. Kok. Efficient discovery of frequent unordered trees. In First International Workshop on Mining Graphs, Trees and Sequences, pages 55--64, 2003."},{"key":"e_1_3_2_1_12_1","first-page":"853","volume-title":"Proceedings of the Seventeenth IJCAI","author":"Raedt L. D.","year":"2001","unstructured":"L. D. Raedt and S. Kramer . The level-wise version space algorithm and its application to molecular fragment finding . In Proceedings of the Seventeenth IJCAI , pages 853 -- 859 , 2001 . L. D. Raedt and S. Kramer. The level-wise version space algorithm and its application to molecular fragment finding. In Proceedings of the Seventeenth IJCAI, pages 853--859, 2001."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/967900.968018"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956784"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775058"}],"event":{"name":"KDD04: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Seattle WA USA","acronym":"KDD04","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014134","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1014052.1014134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:31:25Z","timestamp":1750264285000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1014052.1014134"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,8,22]]},"references-count":14,"alternative-id":["10.1145\/1014052.1014134","10.1145\/1014052"],"URL":"https:\/\/doi.org\/10.1145\/1014052.1014134","relation":{},"subject":[],"published":{"date-parts":[[2004,8,22]]},"assertion":[{"value":"2004-08-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}