{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T07:11:40Z","timestamp":1766301100146,"version":"3.37.3"},"reference-count":21,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","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"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1447711","1743418","1843025"],"award-info":[{"award-number":["1447711","1743418","1843025"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Comput. Biol. and Bioinf."],"published-print":{"date-parts":[[2021,1,1]]},"DOI":"10.1109\/tcbb.2020.3024222","type":"journal-article","created":{"date-parts":[[2020,9,15]],"date-time":"2020-09-15T20:46:27Z","timestamp":1600202787000},"page":"27-37","source":"Crossref","is-referenced-by-count":2,"title":["EMS3: An Improved Algorithm for Finding Edit-Distance Based Motifs"],"prefix":"10.1109","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5566-0207","authenticated-orcid":false,"given":"Peng","family":"Xiao","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, University of Connecticut, Storrs, CT, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1537-7161","authenticated-orcid":false,"given":"Xingyu","family":"Cai","sequence":"additional","affiliation":[{"name":"Baidu USA LLC, Sunnyvale, CA, USA"}]},{"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, USA"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/S0890-5401(03)00057-9"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"374","DOI":"10.1007\/BFb0054337","article-title":"Spelling approximate repeated or common motifs using a suffix tree","author":"sagot","year":"1998","journal-title":"Proc Latin Amer Symp Theor Informat"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45784-4_11"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/s10877-005-0677-y"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054113500159"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1186\/s12864-016-2789-9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/BIBM.2016.7822598"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/369133.369172"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746612"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729330"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gky237"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx381"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/srep07813"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2014.2306842"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2940115"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-018-2242-y"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2014.08.009"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1038\/nbt0806-959"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/279069.279119"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1038\/nbt1053"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkt1249"}],"container-title":["IEEE\/ACM Transactions on Computational Biology and Bioinformatics"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/8857\/9346082\/9198128-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8857\/9346082\/09198128.pdf?arnumber=9198128","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:51:23Z","timestamp":1649443883000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9198128\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":21,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcbb.2020.3024222","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":[[2021,1,1]]}}}