{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,12]],"date-time":"2025-12-12T13:04:45Z","timestamp":1765544685671,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T00:00:00Z","timestamp":1539734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000009","name":"Foundation for the National Institutes of Health","doi-asserted-by":"publisher","award":["1R01AI108888"],"award-info":[{"award-number":["1R01AI108888"]}],"id":[{"id":"10.13039\/100000009","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1525024, IIS-1633215"],"award-info":[{"award-number":["CCF-1525024, IIS-1633215"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,17]]},"DOI":"10.1145\/3269206.3271688","type":"proceedings-article","created":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T12:08:27Z","timestamp":1540210107000},"page":"267-276","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Smooth q-Gram, and Its Applications to Detection of Overlaps among Long, Error-Prone Sequencing Reads"],"prefix":"10.1145","author":[{"given":"Haoyu","family":"Zhang","sequence":"first","affiliation":[{"name":"Indiana University Bloomington, Bloomginton, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Qin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haixu","family":"Tang","sequence":"additional","affiliation":[{"name":"Indiana University Bloomington, Bloomington, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80360-2"},{"volume-title":"Edit Distance: Sketching, Streaming, and Document Exchange. In FOCS. 51--60.","year":"2016","author":"Belazzougui Djamal","key":"e_1_3_2_1_2_1"},{"volume-title":"Phillippy","year":"2015","author":"Berlin Konstantin","key":"e_1_3_2_1_3_1"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276781"},{"volume-title":"NISC Comparative Sequencing Program, and others","year":"2003","author":"Brudno Michael","key":"e_1_3_2_1_5_1"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Stefan Burkhardt and Juha K\u00e4rkk\u00e4inen. 2001. Better filtering with gapped q-grams. In CPM. 73--85. Stefan Burkhardt and Juha K\u00e4rkk\u00e4inen. 2001. Better filtering with gapped q-grams. In CPM. 73--85.","DOI":"10.1007\/3-540-48194-X_6"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Stefan Burkhardt and Juha K\u00e4rkk\u00e4inen. 2002. One-gapped q-gram filters for Levenshtein distance. In CPM. 225--234. Stefan Burkhardt and Juha K\u00e4rkk\u00e4inen. 2002. One-gapped q-gram filters for Levenshtein distance. In CPM. 225--234.","DOI":"10.1007\/3-540-45452-7_19"},{"volume-title":"Better filtering with gapped q-grams. Fundamenta informaticae","year":"2003","author":"Burkhardt Stefan","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-13-238"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897577"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","first-page":"394","DOI":"10.1111\/j.2517-6161.1983.tb01268.x","article-title":"Estimating Parameters in Continuous Univariate Distributions with a Shifted Origin","volume":"45","author":"Cheng R. C. H.","year":"1983","journal-title":"Journal of the Royal Statistical Society"},{"volume-title":"How to apply de Bruijn graphs to genome assembly. Nature biotechnology","year":"2011","author":"Compeau Phillip E. C.","key":"e_1_3_2_1_12_1"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(03)00382-2"},{"volume-title":"Phillippy","year":"2015","author":"Koren Sergey","key":"e_1_3_2_1_14_1"},{"volume-title":"Phillippy","year":"2017","author":"Koren Sergey","key":"e_1_3_2_1_15_1"},{"volume-title":"Salzberg","year":"2004","author":"Kurtz Stefan","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw152"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/18.3.440"},{"volume-title":"Manning and Hinrich Sch\u00fctze","year":"1999","author":"Christopher","key":"e_1_3_2_1_19_1"},{"volume-title":"Tin","year":"2014","author":"Mikheyev Alexander S.","key":"e_1_3_2_1_20_1"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ygeno.2010.03.001"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01840433"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Gene Myers. 2014. Efficient Local Alignment Discovery amongst Noisy Long Reads. In WABI. 52--67. Gene Myers. 2014. Efficient Local Alignment Discovery amongst Noisy Long Reads. In WABI. 52--67.","DOI":"10.1007\/978-3-662-44753-6_5"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.171285098"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989431"},{"volume-title":"Schatz","year":"2013","author":"Roberts Richard J.","key":"e_1_3_2_1_26_1"},{"volume-title":"Human-mouse alignments with BLASTZ. Genome research","year":"2003","author":"Schwartz Scott","key":"e_1_3_2_1_27_1"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213847"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453957"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098003"}],"event":{"name":"CIKM '18: The 27th ACM International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Torino Italy","acronym":"CIKM '18"},"container-title":["Proceedings of the 27th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3271688","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3269206.3271688","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3269206.3271688","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:44:22Z","timestamp":1750207462000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3271688"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,10,17]]},"references-count":30,"alternative-id":["10.1145\/3269206.3271688","10.1145\/3269206"],"URL":"https:\/\/doi.org\/10.1145\/3269206.3271688","relation":{},"subject":[],"published":{"date-parts":[[2018,10,17]]},"assertion":[{"value":"2018-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}