{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:55:30Z","timestamp":1755838530610,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":20,"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":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61472296,61472297,61202279"],"award-info":[{"award-number":["61472296,61472297,61202279"]}],"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":[[2016,8,13]]},"DOI":"10.1145\/2939672.2939842","type":"proceedings-article","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T18:33:46Z","timestamp":1470681226000},"page":"1725-1734","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["A Real Linear and Parallel Multiple Longest Common Subsequences (MLCS) Algorithm"],"prefix":"10.1145","author":[{"given":"Yanni","family":"Li","sequence":"first","affiliation":[{"name":"Xidian University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hui","family":"Li","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tihua","family":"Duan","sequence":"additional","affiliation":[{"name":"Shanghai Finance University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Wang","sequence":"additional","affiliation":[{"name":"Conventry University, Conventry, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhi","family":"Wang","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Cheng","sequence":"additional","affiliation":[{"name":"Xidian University, Xi'an, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2016,8,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90132-Y"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-S4-S4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"key":"e_1_3_2_1_4_1","first-page":"20","volume-title":"KDD","author":"Hofacker I. L.","year":"1996","unstructured":"I. L. Hofacker , M. A. Huynen , P. F. Stadler , and P. E. Stolorz . Knowledge discovery in RNA sequence families of HIV using scalable computers . In KDD , pages 20 -- 25 , 1996 . I. L. Hofacker, M. A. Huynen, P. F. Stadler, and P. E. Stolorz. Knowledge discovery in RNA sequence families of HIV using scalable computers. In KDD, pages 20--25, 1996."},{"key":"e_1_3_2_1_5_1","volume-title":"Pitman","author":"Horowitz E.","year":"1983","unstructured":"E. Horowitz and S. Sahni . Fundamentals of data structures . Pitman , 1983 . E. Horowitz and S. Sahni. Fundamentals of data structures. Pitman, 1983."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934514"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/359581.359603"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020519"},{"key":"e_1_3_2_1_9_1","volume-title":"Volume I: Fundamental Algorithms","author":"Knuth D. E.","year":"1973","unstructured":"D. E. Knuth . The Art of Computer Programming , Volume I: Fundamental Algorithms , 2 nd Edition. Addison-Wesley , 1973 . D. E. Knuth. The Art of Computer Programming, Volume I: Fundamental Algorithms, 2nd Edition. Addison-Wesley, 1973.","edition":"2"},{"key":"e_1_3_2_1_10_1","volume-title":"TR01--148","author":"Korkin D.","year":"2001","unstructured":"D. Korkin . A new dominant point-based parallel algorithm for multiple longest common subsequence problem. Technical report , TR01--148 , Univ. of New Brunswick , 2001 . D. Korkin. A new dominant point-based parallel algorithm for multiple longest common subsequence problem. Technical report, TR01--148, Univ. of New Brunswick, 2001."},{"key":"e_1_3_2_1_11_1","first-page":"2012","article-title":"Facc: a novel finite automaton based on cloud computing for the multiple longest common subsequences search","author":"Li Y.","year":"2012","unstructured":"Y. Li , Y. Wang , and L. Bao . Facc: a novel finite automaton based on cloud computing for the multiple longest common subsequences search . Mathematical Problems in Engineering , 2012 , 2012 . Y. Li, Y. Wang, and L. Bao. Facc: a novel finite automaton based on cloud computing for the multiple longest common subsequences search. Mathematical Problems in Engineering, 2012, 2012.","journal-title":"Mathematical Problems in Engineering"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.298210"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/322063.322075"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90002-1"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.69.1.4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.123"},{"key":"e_1_3_2_1_17_1","first-page":"499","volume-title":"Proceedings of the World Congress on Engineering","volume":"1","author":"Yang J.","year":"2010","unstructured":"J. Yang , Y. Xu , and Y. Shang . An efficient parallel algorithm for longest common subsequence problem on GPUs . In Proceedings of the World Congress on Engineering , volume 1 , pages 499 -- 504 , 2010 . J. Yang, Y. Xu, and Y. Shang. An efficient parallel algorithm for longest common subsequence problem on GPUs. In Proceedings of the World Congress on Engineering, volume 1, pages 499--504, 2010."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.202"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.674320"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1201\/9780203852507"}],"event":{"name":"KDD '16: The 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"San Francisco California USA","acronym":"KDD '16"},"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.2939842","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2939672.2939842","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.2939842"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,13]]},"references-count":20,"alternative-id":["10.1145\/2939672.2939842","10.1145\/2939672"],"URL":"https:\/\/doi.org\/10.1145\/2939672.2939842","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"}}]}}