{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T15:57:29Z","timestamp":1742399849269},"reference-count":0,"publisher":"Association for Computing Machinery (ACM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["ACM Trans. Algorithms","TALG"],"published-print":{"date-parts":[[2007,2,1]]},"DOI":"10.1145\/1219944.1219947","type":"journal-article","created":{"date-parts":[[2007,4,5]],"date-time":"2007-04-05T15:20:08Z","timestamp":1175786408000},"page":"2","source":"Crossref","is-referenced-by-count":9,"title":["The string edit distance matching problem with moves"],"prefix":"10.1145","volume":"3","author":[{"given":"Graham","family":"Cormode","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Muthukrishnan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","container-title":["ACM Transactions on Algorithms"],"original-title":[],"language":"en","deposited":{"date-parts":[[2014,11,4]],"date-time":"2014-11-04T12:02:09Z","timestamp":1415102529000},"score":1,"resource":{"primary":{"URL":"http:\/\/portal.acm.org\/citation.cfm?doid=1219944.1219947"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,2,1]]},"references-count":0,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,2,1]]}},"URL":"https:\/\/doi.org\/10.1145\/1219944.1219947","relation":{},"ISSN":["1549-6325"],"issn-type":[{"value":"1549-6325","type":"print"}],"subject":[],"published":{"date-parts":[[2007,2,1]]}}}