{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T14:23:31Z","timestamp":1780410211553,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T00:00:00Z","timestamp":1402358400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004837","name":"Ministerio de Ciencia e Innovaci\u00f3n","doi-asserted-by":"publisher","award":["TIN2011-28689-C02-01"],"award-info":[{"award-number":["TIN2011-28689-C02-01"]}],"id":[{"id":"10.13039\/501100004837","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,6,10]]},"DOI":"10.1145\/2597652.2597677","type":"proceedings-article","created":{"date-parts":[[2014,6,10]],"date-time":"2014-06-10T12:50:25Z","timestamp":1402404625000},"page":"103-112","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":31,"title":["Thread-cooperative, bit-parallel computation of levenshtein distance on GPU"],"prefix":"10.1145","author":[{"given":"Alejandro","family":"Chac\u00f3n","sequence":"first","affiliation":[{"name":"Universitat Aut\u00f2noma de Barcelona, Bellaterra (Barcelona), Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Santiago","family":"Marco-Sola","sequence":"additional","affiliation":[{"name":"Centro Nacional de An\u00e1lisis Gen\u00f3mico, Barcelona, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Antonio","family":"Espinosa","sequence":"additional","affiliation":[{"name":"Universitat Aut\u00f2noma de Barcelona, Bellaterra (Barcelona), Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Ribeca","sequence":"additional","affiliation":[{"name":"Centro Nacional de An\u00e1lisis Gen\u00f3mico, Barcelona, Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Juan Carlos","family":"Moure","sequence":"additional","affiliation":[{"name":"Universitat Aut\u00f2noma de Barcelona, Bellaterra (Barcelona), Spain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2014,6,10]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-9-11"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/InPar.2012.6339593"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/795666.796543"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2011.182"},{"issue":"1","key":"e_1_3_2_1_6_1","first-page":"39","article-title":"A Bit-Vector algorithm for computing Levenshtein and Damerau edit distances","volume":"10","author":"Hyyr\u00f6 H.","year":"2003","unstructured":"H. Hyyr\u00f6 . A Bit-Vector algorithm for computing Levenshtein and Damerau edit distances . In Nordic Journal of Computing , 10 ( 1 ):29{ 39 , 2003 . H. Hyyr\u00f6. A Bit-Vector algorithm for computing Levenshtein and Damerau edit distances. In Nordic Journal of Computing, 10(1):29{39, 2003.","journal-title":"Nordic Journal of Computing"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.5555\/647821.736383"},{"key":"e_1_3_2_1_8_1","series-title":"LNCS","first-page":"95","volume-title":"Facing the Multicore-Challenge II","author":"Kawanami K.","unstructured":"K. Kawanami and N. Fujimoto . GPU accelerated computation of the longest common subsequence . In Facing the Multicore-Challenge II , volume 7174 of LNCS , pages 84{ 95 . Springer Berlin Heidelberg, 2012. K. Kawanami and N. Fujimoto. GPU accelerated computation of the longest common subsequence. In Facing the Multicore-Challenge II, volume 7174 of LNCS, pages 84{95. Springer Berlin Heidelberg, 2012."},{"key":"e_1_3_2_1_9_1","volume-title":"Freie Universit\u00e4t Berlin","author":"Langner L.","year":"2011","unstructured":"L. Langner , K. Reinert , and D. Weese . Myers Bit-Vector Algorithm on GPU for SeqAn. Master's thesis , Freie Universit\u00e4t Berlin , 2011 . L. Langner, K. Reinert, and D. Weese. Myers Bit-Vector Algorithm on GPU for SeqAn. Master's thesis, Freie Universit\u00e4t Berlin, 2011."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp324"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2008.31"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1186\/1756-0500-3-93"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-14-117"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/144953.144998"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-9-S2-S10"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1038\/nmeth.2221"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316550"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/375360.375365"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bts649"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/2606265.2606909"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(80)90016-4"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(81)90087-5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2513456.2513473"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(85)90023-9"}],"event":{"name":"ICS'14: 2014 International Conference on Supercomputing","location":"Munich Germany","acronym":"ICS'14","sponsor":["SIGARCH ACM Special Interest Group on Computer Architecture"]},"container-title":["Proceedings of the 28th ACM international conference on Supercomputing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2597652.2597677","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2597652.2597677","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:09:58Z","timestamp":1750234198000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2597652.2597677"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,10]]},"references-count":24,"alternative-id":["10.1145\/2597652.2597677","10.1145\/2597652"],"URL":"https:\/\/doi.org\/10.1145\/2597652.2597677","relation":{},"subject":[],"published":{"date-parts":[[2014,6,10]]},"assertion":[{"value":"2014-06-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}