{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:24:04Z","timestamp":1750220644150,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,12,18]],"date-time":"2020-12-18T00:00:00Z","timestamp":1608249600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61602401,61873337"],"award-info":[{"award-number":["61602401,61873337"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,12,18]]},"DOI":"10.1145\/3443279.3443311","type":"proceedings-article","created":{"date-parts":[[2021,2,1]],"date-time":"2021-02-01T22:50:44Z","timestamp":1612219844000},"page":"200-204","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Divide-and-Conquer Algorithm for Finding Top-k Longest Common Subsequence"],"prefix":"10.1145","author":[{"given":"Xuan","family":"Wang","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Donghua University, Shanghai, CHINA"}]},{"given":"Chen","family":"Ziyang","sequence":"additional","affiliation":[{"name":"School of Information Management, Shanghai Lixin University of Accounting and Finance, Shanghai, CHINA"}]},{"given":"Zhai","family":"Lusha","sequence":"additional","affiliation":[{"name":"School of Information Science and Engineering, Yanshan University Qinghuangdao, CHINA"}]}],"member":"320","published-online":{"date-parts":[[2021,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00264437"},{"key":"e_1_3_2_1_2_1","volume-title":"the Proceedings of the 7th international Symposium on String Processing Information Retrieval, (A Curuna","author":"Hoshino H.","year":"2000","unstructured":"Hoshino H. , Shinohara A. , and Takeda M . 2000. Online construction of subsequence automata for multiple texts . In the Proceedings of the 7th international Symposium on String Processing Information Retrieval, (A Curuna , Spain September 2000 ), 437--443 Hoshino H., Shinohara A., and Takeda M. 2000. Online construction of subsequence automata for multiple texts. In the Proceedings of the 7th international Symposium on String Processing Information Retrieval, (A Curuna, Spain September 2000), 437--443"},{"key":"e_1_3_2_1_3_1","unstructured":"Hofacker I.L. Huynen M.A. and Stadler P.F. 1996. Knowledge discovery in RNA sequence families of HIV using scalable computers. KDD 1460--1483  Hofacker I.L. Huynen M.A. and Stadler P.F. 1996. Knowledge discovery in RNA sequence families of HIV using scalable computers. KDD 1460--1483"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.674320"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/359581.359603"},{"issue":"4","key":"e_1_3_2_1_8_1","first-page":"1","article-title":"A fast parallel algorithm for finding the longest common sequence of multiple bio-sequences","volume":"7","author":"Chen Y.","year":"2006","unstructured":"Chen Y. , Wan A. , Liu W. 2006 . A fast parallel algorithm for finding the longest common sequence of multiple bio-sequences . BMC Bioinformatics. 7 ( 4 ): 1 -- 12 Chen Y., Wan A., Liu W. 2006. A fast parallel algorithm for finding the longest common sequence of multiple bio-sequences. BMC Bioinformatics. 7(4):1--12","journal-title":"BMC Bioinformatics."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498322"}],"event":{"name":"NLPIR 2020: 4th International Conference on Natural Language Processing and Information Retrieval","sponsor":["FernUniversit\u00e4t in Hagen"],"location":"Seoul Republic of Korea","acronym":"NLPIR 2020"},"container-title":["Proceedings of the 4th International Conference on Natural Language Processing and Information Retrieval"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3443279.3443311","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3443279.3443311","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:02:12Z","timestamp":1750197732000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3443279.3443311"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,18]]},"references-count":9,"alternative-id":["10.1145\/3443279.3443311","10.1145\/3443279"],"URL":"https:\/\/doi.org\/10.1145\/3443279.3443311","relation":{},"subject":[],"published":{"date-parts":[[2020,12,18]]},"assertion":[{"value":"2021-02-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}