{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T20:36:11Z","timestamp":1730234171625,"version":"3.28.0"},"reference-count":7,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T00:00:00Z","timestamp":1650585600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T00:00:00Z","timestamp":1650585600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,4,22]]},"DOI":"10.1109\/icccs55155.2022.9846661","type":"proceedings-article","created":{"date-parts":[[2022,8,15]],"date-time":"2022-08-15T16:02:40Z","timestamp":1660579360000},"page":"37-41","source":"Crossref","is-referenced-by-count":0,"title":["Checklist Screening Similarity Matching Algorithm Based on Decision Fusion"],"prefix":"10.1109","author":[{"given":"Rongqing","family":"Zhong","sequence":"first","affiliation":[{"name":"Bigdata Center of CCB Fintech,Xiamen,China"}]},{"given":"Jing","family":"Li","sequence":"additional","affiliation":[{"name":"Wangsu Science & Technology Co., Ltd,Xiamen,China"}]},{"given":"Qi","family":"Yang","sequence":"additional","affiliation":[{"name":"Xiamen University,Xiamen,China"}]}],"member":"263","reference":[{"key":"ref4","first-page":"191","article-title":"Algorithms for Evaluating Length of the Longest Common Substring[J]","volume":"28","author":"xinchun","year":"1998","journal-title":"Journal of Southeast University"},{"key":"ref3","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions, and reversals","volume":"10","author":"levenshtein","year":"1965","journal-title":"Soviet Physics Doklady"},{"key":"ref6","first-page":"1","article-title":"Bounds on the Complexity of the Longest Common Subsequence Problem [J]","volume":"23","author":"aho","year":"1976"},{"key":"ref5","first-page":"101","article-title":"The comparison of LCS Algorithm with the GST Algorithm in Strings Similarity Metrics[J]","volume":"24","author":"haiying","year":"2011","journal-title":"Electronic Sci&Tech"},{"year":"0","key":"ref7"},{"year":"0","key":"ref2"},{"year":"0","key":"ref1"}],"event":{"name":"2022 7th International Conference on Computer and Communication Systems (ICCCS)","start":{"date-parts":[[2022,4,22]]},"location":"Wuhan, China","end":{"date-parts":[[2022,4,25]]}},"container-title":["2022 7th International Conference on Computer and Communication Systems (ICCCS)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9845797\/9845820\/09846661.pdf?arnumber=9846661","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,5]],"date-time":"2022-09-05T16:24:42Z","timestamp":1662395082000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9846661\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,22]]},"references-count":7,"URL":"https:\/\/doi.org\/10.1109\/icccs55155.2022.9846661","relation":{},"subject":[],"published":{"date-parts":[[2022,4,22]]}}}