{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T00:33:22Z","timestamp":1787013202451,"version":"build-2736575974"},"reference-count":89,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,11,1]],"date-time":"2023-11-01T00:00:00Z","timestamp":1698796800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2023,11,1]]},"DOI":"10.1109\/tkde.2022.3231780","type":"journal-article","created":{"date-parts":[[2023,1,16]],"date-time":"2023-01-16T14:23:31Z","timestamp":1673879011000},"page":"11093-11111","source":"Crossref","is-referenced-by-count":14,"title":["Bidirectional String Anchors for Improved Text Indexing and Top-$K$ Similarity Search"],"prefix":"10.1109","volume":"35","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0888-5061","authenticated-orcid":false,"given":"Grigorios","family":"Loukides","sequence":"first","affiliation":[{"name":"King's College London, London, U.K."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1445-1932","authenticated-orcid":false,"given":"Solon P.","family":"Pissis","sequence":"additional","affiliation":[{"name":"CWI, Amsterdam, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1200-6015","authenticated-orcid":false,"given":"Michelle","family":"Sweering","sequence":"additional","affiliation":[{"name":"CWI, Amsterdam, The Netherlands"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872796"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw152"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3385898"},{"key":"ref56","first-page":"303","article-title":"VGRAM: Improving performance of approximate queries on string collections using variable-length grams","author":"li","year":"2007","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007374"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp324"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btw279"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty191"},{"key":"ref53","author":"korf","year":"2003","journal-title":"BLAST - An Essential Guide to the Basic Local Alignment Search Tool"},{"key":"ref52","first-page":"28:1","article-title":"Minimal suffix and rotation of a substring in optimal time","author":"kociumaka","year":"2016","journal-title":"Proc Ann Symp Combinatorial Pattern Matching"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1998196.1998198"},{"key":"ref55","first-page":"707","article-title":"Binary codes capable of correcting deletions, insertions and reversals","volume":"10","author":"levenshtein","year":"1966","journal-title":"Sov Phys Doklady"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(80)90149-0"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2009-10-3-r25"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-013-9860-6"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/27.11.2369"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3307339.3342144"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1016\/j.cell.2013.09.006"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/3313276.3316368"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/1217856.1217858"},{"key":"ref45","first-page":"351","article-title":"Efficient index structures for string databases","author":"kahveci","year":"0","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btab313"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1147\/rd.312.0249"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2018.0036"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa472"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2015.2485213"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807266"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btaa435"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2020.0432"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty597"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45257-5_13"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48194-X_17"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch143"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2591796.2591885"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2021.3136792"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1104"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2019.104462"},{"key":"ref5","author":"baeza-yates","year":"2011","journal-title":"Modern Information Retrieval - The Concepts and Technology behind Search"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1145\/2093973.2093980"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v24i1.7527"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/070685373"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403099"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-016-0449-y"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2014-15-3-r46"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07959-2_28"},{"key":"ref79","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1973.13"},{"key":"ref34","first-page":"54:1","article-title":"Fast preprocessing for optimal orthogonal range reporting and range successor with applications to text indexing","author":"gao","year":"2020","journal-title":"Proc Annu Eur Symp Algorithms"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.14778\/2732219.2732220"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702402354"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2481"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1089\/cmb.2021.0599"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975499.13"},{"key":"ref30","article-title":"An implementation of range trees with fractional cascading in C","author":"fisikopoulos","year":"2011"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-08442-8_83"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3375890"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213847"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/828.1884"},{"key":"ref76","year":"2021","journal-title":"CGAL Editorial Board"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1990.9999"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1995.380415"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-04749-7_4"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bth408"},{"key":"ref70","author":"ramakrishnan","year":"2003","journal-title":"Database Management Systems (3 ed)"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872770"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1961-015-3"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509915"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43681-4_21"},{"key":"ref23","first-page":"39:1","article-title":"Practical performance of space efficient data structures for longest common extensions","author":"dinklage","year":"2020","journal-title":"Proc Annu Eur Symp Algorithms"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btab156"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45257-5_3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.7717\/peerj.10805"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1145\/2508020.2508023"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2593675"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty258"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btv022"},{"key":"ref66","first-page":"408","article-title":"Space-efficient construction of compressed indexes in deterministic linear time","author":"munro","year":"2017","journal-title":"Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2013.6544886"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btx235"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1082036.1082039"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1997.646102"},{"key":"ref29","article-title":"Pizza&Chili corpus–compressed indexes and their testbeds","author":"ferragina","year":"0"},{"key":"ref60","first-page":"64:1","article-title":"Bidirectional string anchors: A new string sampling mechanism","author":"loukides","year":"2021","journal-title":"Proc Annu Eur Symp Algorithms"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/11682462_64"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/10273671\/10018284.pdf?arnumber=10018284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T15:28:55Z","timestamp":1698679735000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10018284\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,1]]},"references-count":89,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2022.3231780","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,11,1]]}}}