{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T02:06:05Z","timestamp":1781057165742,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,8,13]],"date-time":"2016-08-13T00:00:00Z","timestamp":1471046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"MEXT\/JSPS Kakenhi","award":["24700140"],"award-info":[{"award-number":["24700140"]}]},{"name":"MEXT\/JSPS Kakenhi","award":["25700004"],"award-info":[{"award-number":["25700004"]}]},{"name":"MEXT\/JSPS Kakenhi","award":["25700029"],"award-info":[{"award-number":["25700029"]}]},{"name":"the JST PRESTO program"},{"name":"the Academy of Finland","award":["294143"],"award-info":[{"award-number":["294143"]}]},{"name":"the Program to Disseminate Tenure Tracking System"},{"name":"MEXT and Kyushu University Interdisciplinary Programs in Edu- cation and Projects in Research Development"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,8,13]]},"DOI":"10.1145\/2939672.2939864","type":"proceedings-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T18:33:46Z","timestamp":1470681226000},"page":"1875-1884","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":17,"title":["Scalable Partial Least Squares Regression on Grammar-Compressed Data Matrices"],"prefix":"10.1145","author":[{"given":"Yasuo","family":"Tabei","sequence":"first","affiliation":[{"name":"Japan Science and Technology Agency, Saitama, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hiroto","family":"Saigo","sequence":"additional","affiliation":[{"name":"Kyushu University, Fukuoka , Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yoshihiro","family":"Yamanishi","sequence":"additional","affiliation":[{"name":"Kyushu University, Fukuoka, Japan"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Simon J.","family":"Puglisi","sequence":"additional","affiliation":[{"name":"University of Helsinki, Helsinki, Finland"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38905-4_8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.850116"},{"key":"e_1_3_2_1_3_1","first-page":"2044","article-title":"PubChem as a source of polypharmacology","volume":"49","author":"Chen B.","year":"2009","unstructured":"B. Chen , D. Wild , and R. Guha . PubChem as a source of polypharmacology . JCIM , 49 : 2044 -- 2055 , 2009 . B. Chen, D. Wild, and R. Guha. PubChem as a source of polypharmacology. JCIM, 49:2044--2055, 2009.","journal-title":"JCIM"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkp846"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.001"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740658"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03192"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2021068"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2723372.2751520"},{"key":"e_1_3_2_1_10_1","first-page":"1871","volume-title":"JMLR","author":"Fan R.","year":"2008","unstructured":"R. Fan , K. W. Chang , C. J. Hsieh , X. R. Wang , and C. J. Lin . LIBLINEAR: A library for large linear classification . JMLR , pages 1871 -- 1874 , 2008 . R. Fan, K. W. Chang, C. J. Hsieh, X. R. Wang, and C. J. Lin. LIBLINEAR: A library for large linear classification. JMLR, pages 1871--1874, 2008."},{"key":"e_1_3_2_1_11_1","volume-title":"Computer Vision: A Modern Approach","author":"Forsyth D. A.","year":"2002","unstructured":"D. A. Forsyth and J. Ponce . Computer Vision: A Modern Approach . Prentice Hall Professional Technical Reference , 2002 . D. A. Forsyth and J. Ponce. Computer Vision: A Modern Approach. Prentice Hall Professional Technical Reference, 2002."},{"key":"e_1_3_2_1_12_1","volume-title":"VLDB","author":"Gionis A.","year":"1999","unstructured":"A. Gionis , P. Indyk , and R. Motwani . Similarity search in high dimensions via hashing . In VLDB , 1999 . A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, 1999."},{"key":"e_1_3_2_1_13_1","first-page":"529","volume-title":"STACS","author":"Hermelin D.","year":"2009","unstructured":"D. Hermelin , D. H. Landau , and O. Weimann . A unified algorithm for accelerating edit-distance computation via text-compression . In STACS , pages 529 -- 540 , 2009 . D. Hermelin, D. H. Landau, and O. Weimann. A unified algorithm for accelerating edit-distance computation via text-compression. In STACS, pages 529--540, 2009."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-1904-8"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/762471.762473"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/18.850665"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkp937"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.6028\/jres.045.026"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/789086.789701"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772759"},{"key":"e_1_3_2_1_21_1","first-page":"2672","volume-title":"NIPS","author":"Li P.","year":"2011","unstructured":"P. Li , A. Shrivastava , J. L. Moore , and A. C. K\u00f6nig . Hashing algorithms for large-scale learning . In NIPS , pages 2672 -- 2680 , 2011 . P. Li, A. Shrivastava, J. L. Moore, and A. C. K\u00f6nig. Hashing algorithms for large-scale learning. In NIPS, pages 2672--2680, 2011."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1287369.1287400"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/311445"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507163"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.130"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/11752790_2"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(02)00777-6"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017467"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1038\/35038557"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1186\/1752-0509-7-S6-S3"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1162\/089976699300016728"},{"key":"e_1_3_2_1_32_1","volume-title":"Handbook of Molecular Descriptors","author":"Todeschini R.","year":"2002","unstructured":"R. Todeschini and V. Consonni . Handbook of Molecular Descriptors . Wiley-VCH , 2002 . R. Todeschini and V. Consonni. Handbook of Molecular Descriptors. Wiley-VCH, 2002."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1687878.1687946"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553516"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-103950-9.50017-4"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0169-7439(01)00155-1"},{"key":"e_1_3_2_1_37_1","first-page":"309","volume-title":"CPM","author":"Yamamoto T.","year":"2011","unstructured":"T. Yamamoto , H. Bannai , S. Inenaga , and M. Takeda . Faster subsequence and don't-care pattern maching on compressed texts . In CPM , pages 309 -- 322 , 2011 . T. Yamamoto, H. Bannai, S. Inenaga, and M. Takeda. Faster subsequence and don't-care pattern maching on compressed texts. In CPM, pages 309--322, 2011."},{"key":"e_1_3_2_1_38_1","first-page":"721","volume-title":"ICDM","author":"Yan X.","year":"2002","unstructured":"X. Yan and J. Han . gSpan: graph-based substructure pattern mining . In ICDM , pages 721 -- 724 , 2002 . X. Yan and J. Han. gSpan: graph-based substructure pattern mining. In ICDM, pages 721--724, 2002."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835910"}],"event":{"name":"KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"San Francisco California USA","acronym":"KDD '16","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939864","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939864","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:56:31Z","timestamp":1750222591000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2939672.2939864"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":39,"alternative-id":["10.1145\/2939672.2939864","10.1145\/2939672"],"URL":"https:\/\/doi.org\/10.1145\/2939672.2939864","relation":{},"subject":[],"published":{"date-parts":[[2016,8,13]]},"assertion":[{"value":"2016-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}