{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,24]],"date-time":"2026-07-24T06:51:12Z","timestamp":1784875872739,"version":"3.55.0"},"reference-count":30,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3654667","type":"journal-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T20:40:48Z","timestamp":1768941648000},"page":"13910-13920","source":"Crossref","is-referenced-by-count":1,"title":["Optimal Character Distance Sampling for Exact String Matching Through Set Cover Reformulation"],"prefix":"10.1109","volume":"14","author":[{"given":"Simone","family":"Faro","sequence":"first","affiliation":[{"name":"University of Catania, Catania, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Thierry","family":"Lecroq","sequence":"additional","affiliation":[{"name":"Univ Rouen Normandie, INSA Rouen Normandie, Université Le Havre Normandie, Normandie Univ, Rouen, France"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4722-9542","authenticated-orcid":false,"given":"Francesco Pio","family":"Marino","sequence":"additional","affiliation":[{"name":"University of Catania, Catania, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0436-0"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3777895"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89097-3_10"},{"key":"ref4","volume-title":"Introduction to Algorithms","author":"Cormen","year":"2001"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/2431211.2431212"},{"key":"ref7","first-page":"99","article-title":"The string matching algorithms research tool","volume-title":"Proc. Prague Stringology Conf.","author":"Faro"},{"key":"ref8","first-page":"300","article-title":"Improving sampled matching through character context sampling","volume-title":"Proc. 25th Italian Conf. Theor. Comput. Sci.","author":"Faro"},{"key":"ref9","first-page":"148","article-title":"Reducing time and space in indexed string matching by characters distance text sampling","volume-title":"Proc. Prague Stringology Conf.","author":"Faro"},{"key":"ref10","first-page":"16","article-title":"Beyond Horspool: A comparative analysis in sampled matching","volume-title":"Proc. Prague Stringology Conf.","author":"Faro"},{"key":"ref11","first-page":"13:1","article-title":"The great textual hoax: Boosting sampled string matching with fake samples","volume-title":"Proc. 12th Int. Conf. Fun Algorithms (FUN)","author":"Faro"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-020-00732-4"},{"key":"ref13","first-page":"1","article-title":"Enhancing characters distance text sampling by condensed alphabets","volume-title":"Proc. 22nd Italian Conf. Theor. Comput. Sci.","volume":"3072","author":"Faro"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.12.034"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/acref\/9780192803511.013.0962"},{"key":"ref17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"ref18","first-page":"94","article-title":"Approximating covering and packing problems: Set cover, vertex cover, independent set, and related problems","volume-title":"Approximation Algorithms for NP-hard Problems","author":"Hochbaum","year":"1997"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380100608"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/s0022-0000(74)80044-9"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2013.10.006"},{"key":"ref23","article-title":"Efficient computation of periods and covers using sampling","author":"Lecroq","year":"2024","journal-title":"arXiv:2407.18216"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365x(75)90058-8"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1080\/10589759.2025.2572393"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1016\/j.aei.2025.103716"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/0222058"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3660318.3660327"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/swat.1973.13"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11359247.pdf?arnumber=11359247","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:45:39Z","timestamp":1770065139000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11359247\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":30,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3654667","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}