{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:43:18Z","timestamp":1773931398974,"version":"3.50.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61672444"],"award-info":[{"award-number":["61672444"]}],"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":["61872281"],"award-info":[{"award-number":["61872281"]}],"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":[[2021]]},"DOI":"10.1109\/tkde.2021.3115057","type":"journal-article","created":{"date-parts":[[2021,9,30]],"date-time":"2021-09-30T21:41:27Z","timestamp":1633038087000},"page":"1-1","source":"Crossref","is-referenced-by-count":8,"title":["A Branch Elimination-based Efficient Algorithm for Large-scale Multiple Longest Common Subsequence Problem"],"prefix":"10.1109","author":[{"given":"Shiwei","family":"Wei","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuping","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yiu-ming","family":"Cheung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7493"},{"key":"ref2","article-title":"An algorithm for differential file comparison","author":"Hunt","year":"1975"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1978.4309979"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1089\/106652799318373"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/34.61707"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.3010568"},{"issue":"1","key":"ref7","first-page":"26","article-title":"Genome-scale evolution: Reconstructing gene orders in the ancestral species","volume":"12","author":"Bourque","year":"2002","journal-title":"Genome Res."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2017.01.030"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1093\/protein\/7.2.195"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/1025045"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.69.1.4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/322033.322044"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90002-1"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF01934514"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90132-Y"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/34.192484"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2006.11.006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2014.2304464"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-56279-6_99"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1080\/10556789808805713"},{"key":"ref21","article-title":"A new dominant point-based parallel algorithm for multiple longest common subsequence problem","author":"Korkin","year":"2001"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-7-S4-S4"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ICPP.2008.79"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.123"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2016.7498322"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.3389\/fgene.2017.00104"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa134"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btz725"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TEVC.2016.2600642"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.02.005"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2009.02.005"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09555237.pdf?arnumber=9555237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T22:44:01Z","timestamp":1705013041000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9555237\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/tkde.2021.3115057","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":[[2021]]}}}