{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,22]],"date-time":"2026-07-22T09:44:44Z","timestamp":1784713484729,"version":"3.55.0"},"reference-count":33,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62176202"],"award-info":[{"award-number":["62176202"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62272369"],"award-info":[{"award-number":["62272369"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62372352"],"award-info":[{"award-number":["62372352"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/tkde.2024.3485234","type":"journal-article","created":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T17:50:52Z","timestamp":1729705852000},"page":"15-28","source":"Crossref","is-referenced-by-count":4,"title":["A Novel Key Point Based MLCS Algorithm for Big Sequences Mining"],"prefix":"10.1109","volume":"37","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0304-5664","authenticated-orcid":false,"given":"Yanni","family":"Li","sequence":"first","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi&#x0027;an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4096-6980","authenticated-orcid":false,"given":"Bing","family":"Liu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Illinois at Chicago, Chicago, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tihua","family":"Duan","sequence":"additional","affiliation":[{"name":"Shanghai Yushang Information Technology Company Ltd, Shanghai, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi&#x0027;an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2382-6289","authenticated-orcid":false,"given":"Hui","family":"Li","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi&#x0027;an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5569-0780","authenticated-orcid":false,"given":"Jiangtao","family":"Cui","sequence":"additional","affiliation":[{"name":"School of Computer Science and Technology, Xidian University, Xi&#x0027;an, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/322063.322075"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2017.01.030"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/d41586-020-00845-4"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2020.107385"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.3562070"},{"key":"ref6","article-title":"Similarities and evolutionary relationships of COVID-19 and related viruses","author":"Li","year":"2020"},{"key":"ref7","first-page":"20","article-title":"Knowledge discovery in RNA sequence families of HIV using scalable computers","volume-title":"Proc. 2nd ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining","author":"Hofacker"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020519"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.123"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.69.1.4"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-S4-S4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934514"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1155\/2012\/310328"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498322"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939842"},{"key":"ref16","first-page":"207","article-title":"On multiple longest common subsequence and common motifs with gaps","volume-title":"Proc. Int. Workshop Algorithms Computation","author":"Sayeed"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa134"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2019.102598"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz725"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.jocs.2019.101070"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2021.108059"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2020.106499"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2021.3115057"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-37599-7_14"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2022.10.110"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-022-04906-5"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.202"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2304464"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7493"},{"key":"ref30","article-title":"A new dominant point-based parallel algorithm for multiple longest common subsequence problem","author":"Korkin","year":"2001"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/2908961.2931684"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00500-020-05450-1"},{"key":"ref33","volume-title":"Algorithms","author":"Sedgewick","year":"2011"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/69\/10786487\/10731910.pdf?arnumber=10731910","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,15]],"date-time":"2025-01-15T20:16:57Z","timestamp":1736972217000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10731910\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":33,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2024.3485234","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}