{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T21:30:16Z","timestamp":1761514216881,"version":"3.37.3"},"reference-count":20,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,11,1]],"date-time":"2019-11-01T00:00:00Z","timestamp":1572566400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF","award":["1447711","1743418"],"award-info":[{"award-number":["1447711","1743418"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2019,11,1]]},"DOI":"10.1109\/tcbb.2018.2843364","type":"journal-article","created":{"date-parts":[[2018,6,4]],"date-time":"2018-06-04T22:33:48Z","timestamp":1528151628000},"page":"1912-1921","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Algorithms for Finding the Closest l-Mers in Biological Data"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1537-7161","authenticated-orcid":false,"given":"Xingyu","family":"Cai","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of Connecticut, Storrs, CT"}]},{"given":"Abdullah-Al","family":"Mamun","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Connecticut, Storrs, CT"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0137-4843","authenticated-orcid":false,"given":"Sanguthevar","family":"Rajasekaran","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, University of Connecticut, Storrs, CT"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113316"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0179"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0085"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2000824.2000827"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972795.41"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.jprocont.2015.11.002"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956808"},{"journal-title":"Computer Algorithms C","year":"1996","author":"horowitz","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkt1114"},{"article-title":"UCI machine learning repository","year":"2007","author":"asuncion","key":"ref19"},{"key":"ref4","first-page":"5781","article-title":"On the longest common subsequence problem","volume":"6","author":"gorbenko","year":"2012","journal-title":"Appl Math Sci"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2017.8217702"},{"key":"ref6","first-page":"21","article-title":"Probabilistic algorithms","author":"rabin","year":"0","journal-title":"Algorithms and Complexity"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu331"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27836-8_66"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/335191.335414"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2007.70241"},{"key":"ref1","first-page":"269","article-title":"Combinatorial approaches to finding subtle signals in dna sequences","volume":"8","author":"pevzner","year":"2000","journal-title":"Proc Int Conf Intell Syst Mol Biol 8"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1806907.1806912"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2809695.2809718"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/8929069\/08371302.pdf?arnumber=8371302","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T20:22:54Z","timestamp":1722457374000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8371302\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,1]]},"references-count":20,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2018.2843364","relation":{},"ISSN":["1545-5963","1557-9964","2374-0043"],"issn-type":[{"type":"print","value":"1545-5963"},{"type":"electronic","value":"1557-9964"},{"type":"electronic","value":"2374-0043"}],"subject":[],"published":{"date-parts":[[2019,11,1]]}}}