{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T17:56:04Z","timestamp":1730224564113,"version":"3.28.0"},"reference-count":15,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/grc.2011.6122599","type":"proceedings-article","created":{"date-parts":[[2012,1,11]],"date-time":"2012-01-11T17:03:07Z","timestamp":1326301387000},"page":"231-236","source":"Crossref","is-referenced-by-count":1,"title":["A practical comparison of edit distance approximation algorithms"],"prefix":"10.1109","author":[{"given":"Hiroyuki","family":"Hanada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Atsuyoshi","family":"Nakamura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mineichi","family":"Kudo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"15","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkn664"},{"journal-title":"Introduction to Algorithms","year":"2001","author":"cormen","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkn724"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.43"},{"key":"12","first-page":"40","article-title":"Novel Approaches to Biomolecular Sequence Indexing","volume":"27","author":"karakoc","year":"2004","journal-title":"Bulletin of the IEEE Technical Committee on Data Engineering"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.14"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536444"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2006.v002a011"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109644"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1284320.1284322"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/s10559-007-0075-1"},{"key":"9","first-page":"357","article-title":"The smoothed complexity of edit distance","author":"andoni","year":"0","journal-title":"Proceedings of the 35th International Colloquium on Automata Languages and Programming 2008"},{"key":"8","first-page":"865","article-title":"Overcoming the l1 non-embeddability barrier: Algorithms for product metrics","author":"andoni","year":"0","journal-title":"Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms 2009"}],"event":{"name":"2011 IEEE International Conference on Granular Computing (GrC-2011)","start":{"date-parts":[[2011,11,8]]},"location":"Kaohsiung, Taiwan","end":{"date-parts":[[2011,11,10]]}},"container-title":["2011 IEEE International Conference on Granular Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6112290\/6122548\/06122599.pdf?arnumber=6122599","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T15:50:27Z","timestamp":1490111427000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6122599\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":15,"URL":"https:\/\/doi.org\/10.1109\/grc.2011.6122599","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}