{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:41Z","timestamp":1750306901736,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"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":[[2013,3,18]]},"DOI":"10.1145\/2457317.2457384","type":"proceedings-article","created":{"date-parts":[[2013,3,26]],"date-time":"2013-03-26T12:25:54Z","timestamp":1364300754000},"page":"358-365","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Efficient high-similarity string comparison"],"prefix":"10.1145","author":[{"given":"Alexander","family":"Tiskin","sequence":"first","affiliation":[{"name":"University of Warwick, United Kingdom"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/321921.321922"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/800061.808726"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579338"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4614-1851-1","volume-title":"Designing Sorting Networks: A New Paradigm","author":"Al-Haj Baddar S. W.","year":"2011","unstructured":"S. W. Al-Haj Baddar and K. E. Batcher . Designing Sorting Networks: A New Paradigm . Springer , 2011 . S. W. Al-Haj Baddar and K. E. Batcher. Designing Sorting Networks: A New Paradigm. Springer, 2011."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/8871.8877"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.05.056"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(87)90167-0"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(92)90132-Y"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840365"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1468075.1468121"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/829519.830817"},{"key":"e_1_3_2_1_12_1","series-title":"Computational Biology Series","volume-title":"Sequence Comparison: Theory and Methods","author":"Chao Kun-Mao","year":"2009","unstructured":"Kun-Mao Chao and Louxin Zhang . Sequence Comparison: Theory and Methods , volume 7 of Computational Biology Series . Springer , 2009 . Kun-Mao Chao and Louxin Zhang. Sequence Comparison: Theory and Methods, volume 7 of Computational Biology Series. Springer, 2009."},{"key":"e_1_3_2_1_13_1","series-title":"The MIT Electrical Engineering and Computer Science Series","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , R. L. Rivest , and C. Stein . Introduction to Algorithms . The MIT Electrical Engineering and Computer Science Series . The MIT Press and McGraw--Hill , second edition, 2001 . T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Electrical Engineering and Computer Science Series. The MIT Press and McGraw--Hill, second edition, 2001."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(01)00182-X"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01185430"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/322033.322044"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(84)90025-4"},{"key":"e_1_3_2_1_18_1","volume-title":"Proceedings of AWOCA","author":"Hyyr\u00f6 H.","year":"2004","unstructured":"H. Hyyr\u00f6 . Bit-parallel lcs-length computation revisited . In Proceedings of AWOCA , 2004 . H. Hyyr\u00f6. Bit-parallel lcs-length computation revisited. In Proceedings of AWOCA, 2004."},{"key":"e_1_3_2_1_19_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/978-3-540-24838-5_21","volume-title":"Proceedings of WEA","author":"Hyyr\u00f6 H.","year":"2004","unstructured":"H. Hyyr\u00f6 , K. Fredriksson , and G. Navarro . Increased bit-parallelism for approximate string matching . In Proceedings of WEA , volume 3059 of Lecture Notes in Computer Science , pages 285 -- 298 , 2004 . H. Hyyr\u00f6, K. Fredriksson, and G. Navarro. Increased bit-parallelism for approximate string matching. In Proceedings of WEA, volume 3059 of Lecture Notes in Computer Science, pages 285--298, 2004."},{"key":"e_1_3_2_1_20_1","first-page":"1","volume-title":"Handbook of Computational Molecular Biology","author":"Jackson B. N.","year":"2006","unstructured":"B. N. Jackson and S. Aluru . Pairwise sequence alignment . In Handbook of Computational Molecular Biology , Chapman and Hall\/CRC Computer and Information Science Series, chapter 1, pages 1 - 1 --1-31. Chapman and Hall\/CRC , 2006 . B. N. Jackson and S. Aluru. Pairwise sequence alignment. In Handbook of Computational Molecular Biology, Chapman and Hall\/CRC Computer and Information Science Series, chapter 1, pages 1-1--1-31. Chapman and Hall\/CRC, 2006."},{"key":"e_1_3_2_1_21_1","volume-title":"An Introduction to Bioinformatics Algorithms. Computational Molecular Biology","author":"Jones N. C.","year":"2004","unstructured":"N. C. Jones and P. A. Pevzner . An Introduction to Bioinformatics Algorithms. Computational Molecular Biology . The MIT Press , 2004 . N. C. Jones and P. A. Pevzner. An Introduction to Bioinformatics Algorithms. Computational Molecular Biology. The MIT Press, 2004."},{"key":"e_1_3_2_1_22_1","volume-title":"Sorting and Searching","author":"Knuth D. E.","year":"1998","unstructured":"D. E. Knuth . The Art of Computer Programming : Sorting and Searching , volume 3 . Addison Wesley , 1998 . D. E. Knuth. The Art of Computer Programming: Sorting and Searching, volume 3. Addison Wesley, 1998."},{"key":"e_1_3_2_1_23_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 . Binary codes capable of correcting spurious insertions and deletions of ones . Problems of Information Transmission , 1 : 8 -- 17 , 1965 . V. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Problems of Information Transmission, 1:8--17, 1965.","journal-title":"Problems of Information Transmission"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840446"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/316542.316550"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2836(70)90057-4"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840378"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02526038"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00114-9"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-007-9025-6"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(85)80046-2"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(90)90035-V"}],"event":{"name":"EDBT\/ICDT '13: Joint 2013 EDBT\/ICDT Conferences","acronym":"EDBT\/ICDT '13","location":"Genoa Italy"},"container-title":["Proceedings of the Joint EDBT\/ICDT 2013 Workshops"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457317.2457384","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2457317.2457384","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:19:12Z","timestamp":1750234752000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2457317.2457384"}},"subtitle":["the waterfall algorithm"],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":32,"alternative-id":["10.1145\/2457317.2457384","10.1145\/2457317"],"URL":"https:\/\/doi.org\/10.1145\/2457317.2457384","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}