{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,18]],"date-time":"2025-10-18T15:14:42Z","timestamp":1760800482047,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3472456.3472489","type":"proceedings-article","created":{"date-parts":[[2021,10,5]],"date-time":"2021-10-05T18:39:57Z","timestamp":1633459197000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Parallel Algorithms for String Comparison"],"prefix":"10.1145","author":[{"given":"Nikita","family":"Mishin","sequence":"first","affiliation":[{"name":"Saint Petersburg State University, JetBrains Research, Russia"}]},{"given":"Daniil","family":"Berezun","sequence":"additional","affiliation":[{"name":"Saint Petersburg State University, JetBrains Research, Russia"}]},{"given":"Alexander","family":"Tiskin","sequence":"additional","affiliation":[{"name":"Saint Petersburg State University, Russia"}]}],"member":"320","published-online":{"date-parts":[[2021,10,5]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0743-7315(03)00010-8"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/564870.564916"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-006-1216-z"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.05.056"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/358841.358850"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1873601.1873616"},{"key":"e_1_3_2_1_7_1","volume-title":"Faster Approximate Pattern Matching: A Unified Approach. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). 978\u2013989","author":"Charalampopoulos Panagiotis","year":"2020","unstructured":"Panagiotis Charalampopoulos , Tomasz Kociumaka , and Philip Wellnitz . 2020 . Faster Approximate Pattern Matching: A Unified Approach. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). 978\u2013989 . Panagiotis Charalampopoulos, Tomasz Kociumaka, and Philip Wellnitz. 2020. Faster Approximate Pattern Matching: A Unified Approach. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). 978\u2013989."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109622"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/586845.586953"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00182-X"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"key":"e_1_3_2_1_12_1","volume-title":"Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA","author":"Hyyr\u00f6 Heikki","year":"2004","unstructured":"Heikki Hyyr\u00f6 . 2004 . Bit-parallel LCS-length computation revisited . In Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA 2004). Citeseer, 16\u201327. Heikki Hyyr\u00f6. 2004. Bit-parallel LCS-length computation revisited. In Proc. 15th Australasian Workshop on Combinatorial Algorithms (AWOCA 2004). Citeseer, 16\u201327."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30551-4_49"},{"volume-title":"Parallel String Alignments: Algorithms and Applications","key":"e_1_3_2_1_14_1","unstructured":"Krusche. 2010. Parallel String Alignments: Algorithms and Applications . Warwick University . Krusche. 2010. Parallel String Alignments: Algorithms and Applications. Warwick University."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(89)90010-2"},{"key":"e_1_3_2_1_16_1","first-page":"8","article-title":"Binary codes capable of correcting spurious insertions and deletions of ones","volume":"1","author":"Levenshtein V","year":"1965","unstructured":"V Levenshtein . 1965 . Binary codes capable of correcting spurious insertions and deletions of ones . Problems of Information Transmission 1 (1965), 8 \u2013 17 . V Levenshtein. 1965. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission 1 (1965), 8\u201317.","journal-title":"Problems of Information Transmission"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(80)90002-1"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/CESYS.2016.7889974"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16321-0_9"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2011.06.022"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288489"},{"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.1007\/s11786-007-0033-3"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9830-z"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3350755.3400225"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/79173.79181"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"}],"event":{"name":"ICPP 2021: 50th International Conference on Parallel Processing","acronym":"ICPP 2021","location":"Lemont IL USA"},"container-title":["50th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472489","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3472456.3472489","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:11Z","timestamp":1750193291000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3472456.3472489"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":27,"alternative-id":["10.1145\/3472456.3472489","10.1145\/3472456"],"URL":"https:\/\/doi.org\/10.1145\/3472456.3472489","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-10-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}