{"id":"https://openalex.org/W7125011524","doi":"https://doi.org/10.1109/access.2026.3654667","title":"Optimal Character Distance Sampling for Exact String Matching Through Set Cover Reformulation","display_name":"Optimal Character Distance Sampling for Exact String Matching Through Set Cover Reformulation","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7125011524","doi":"https://doi.org/10.1109/access.2026.3654667"},"language":"en","primary_location":{"id":"doi:10.1109/access.2026.3654667","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3654667","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1109/access.2026.3654667","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5105877451","display_name":"Simone Faro","orcid":"https://orcid.org/0000-0001-5937-5796"},"institutions":[{"id":"https://openalex.org/I39063666","display_name":"University of Catania","ror":"https://ror.org/03a64bh57","country_code":"IT","type":"education","lineage":["https://openalex.org/I39063666"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Simone Faro","raw_affiliation_strings":["University of Catania, Catania, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Catania, Catania, Italy","institution_ids":["https://openalex.org/I39063666"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091783959","display_name":"Thierry Lecroq","orcid":null},"institutions":[{"id":"https://openalex.org/I4210105918","display_name":"Normandie Universit\u00e9","ror":"https://ror.org/01k40cz91","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918"]},{"id":"https://openalex.org/I62396329","display_name":"Universit\u00e9 de Rouen Normandie","ror":"https://ror.org/03nhjew95","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I62396329"]},{"id":"https://openalex.org/I88814501","display_name":"Institut National des Sciences Appliqu\u00e9es Rouen Normandie","ror":"https://ror.org/020ws7586","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210105918","https://openalex.org/I88814501"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Thierry Lecroq","raw_affiliation_strings":["Univ Rouen Normandie, INSA Rouen Normandie, Universit&#x00E9; Le Havre Normandie, Normandie Univ, Rouen, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ Rouen Normandie, INSA Rouen Normandie, Universit&#x00E9; Le Havre Normandie, Normandie Univ, Rouen, France","institution_ids":["https://openalex.org/I4210105918","https://openalex.org/I62396329","https://openalex.org/I88814501"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5123384877","display_name":"Francesco Pio Marino","orcid":null},"institutions":[{"id":"https://openalex.org/I39063666","display_name":"University of Catania","ror":"https://ror.org/03a64bh57","country_code":"IT","type":"education","lineage":["https://openalex.org/I39063666"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Pio Marino","raw_affiliation_strings":["University of Catania, Catania, Italy"],"raw_orcid":"https://orcid.org/0000-0003-4722-9542","affiliations":[{"raw_affiliation_string":"University of Catania, Catania, Italy","institution_ids":["https://openalex.org/I39063666"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":1850,"currency":"USD","value_usd":1850},"apc_paid":{"value":1850,"currency":"USD","value_usd":1850},"fwci":9.572,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.95250022,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":97},"biblio":{"volume":"14","issue":null,"first_page":"13910","last_page":"13920"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.6764000058174133,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.6764000058174133,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12326","display_name":"Network Packet Processing and Optimization","score":0.05660000070929527,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.046300001442432404,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.8166000247001648},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.5615000128746033},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5074999928474426},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.49050000309944153},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.47429999709129333},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.4560999870300293},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.44850000739097595},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.43549999594688416},{"id":"https://openalex.org/keywords/encoding","display_name":"Encoding (memory)","score":0.4255000054836273}],"concepts":[{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.8166000247001648},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6786999702453613},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.5615000128746033},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5074999928474426},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.49050000309944153},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.47429999709129333},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.4560999870300293},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.44850000739097595},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4397999942302704},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.43549999594688416},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.4255000054836273},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4077000021934509},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4074000120162964},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.3944000005722046},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.3781000077724457},{"id":"https://openalex.org/C2780861071","wikidata":"https://www.wikidata.org/wiki/Q1062934","display_name":"Character (mathematics)","level":2,"score":0.36739999055862427},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35499998927116394},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.31619998812675476},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.3140999972820282},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3005000054836273},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.29980000853538513},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.2969000041484833},{"id":"https://openalex.org/C73602740","wikidata":"https://www.wikidata.org/wiki/Q7795822","display_name":"Thompson sampling","level":3,"score":0.2955999970436096},{"id":"https://openalex.org/C2781357197","wikidata":"https://www.wikidata.org/wiki/Q5757597","display_name":"High memory","level":2,"score":0.2904999852180481},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2870999872684479},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2822999954223633},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.27649998664855957},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.27160000801086426},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.27149999141693115},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.260699987411499}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/access.2026.3654667","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3654667","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-05477224v1","is_oa":true,"landing_page_url":"https://cnrs.hal.science/hal-05477224","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"IEEE Access, 2026, 14, pp.13910 - 13920. &#x27E8;10.1109/ACCESS.2026.3654667&#x27E9;","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1109/access.2026.3654667","is_oa":true,"landing_page_url":"https://doi.org/10.1109/access.2026.3654667","pdf_url":null,"source":{"id":"https://openalex.org/S2485537415","display_name":"IEEE Access","issn_l":"2169-3536","issn":["2169-3536"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Access","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320334079","display_name":"Gruppo Nazionale per il Calcolo Scientifico","ror":null}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"<italic":[0,145],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[1,146],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">Character":[2],"Distance":[3],"Sampling</i>":[4],"(CDS)":[5],"is":[6,81],"part":[7],"of":[8,12,30,38,49,61,99,111,143],"a":[9,66,77,121,141,209],"broader":[10],"class":[11],"stringmatching":[13],"techniques":[14],"that":[15,113,203],"leverage":[16],"sampling":[17],"strategies.":[18],"These":[19],"methods":[20],"provide":[21],"an":[22,131],"effective":[23],"compromise":[24],"between":[25,58,170],"the":[26,34,50,56,96,104,109,144,153,167,173,204,229],"prohibitive":[27],"space":[28],"requirements":[29],"offline":[31],"approaches":[32],"and":[33,76,108,158,172,184],"high":[35],"computational":[36],"costs":[37],"online":[39],"solutions.":[40],"In":[41,126],"recent":[42],"years,":[43],"CDS":[44,171,182],"has":[45,71],"emerged":[46],"as":[47,140,161],"one":[48],"most":[51],"efficient":[52,244],"sampling-based":[53],"techniques,":[54],"encoding":[55],"distances":[57],"consecutive":[59],"occurrences":[60],"selected":[62],"pivot":[63,100],"characters":[64,101,159],"within":[65],"string.":[67],"However,":[68],"its":[69,90,240],"effectiveness":[70,187],"been":[72],"validated":[73],"only":[74],"experimentally,":[75],"formal":[78],"theoretical":[79,168],"foundation":[80],"still":[82],"lacking":[83],"to":[84,102,134,155,222,225,237],"address":[85],"key":[86],"challenges":[87,94],"associated":[88],"with":[89,215],"application.":[91],"Among":[92],"these":[93],"are":[95],"optimal":[97,181],"selection":[98],"enhance":[103],"sampled":[105,216],"text":[106,217],"representation":[107,231],"handling":[110],"patterns":[112],"do":[114],"not":[115],"contain":[116],"any":[117],"pivots,":[118],"which":[119],"represents":[120],"worst-case":[122,190],"scenario":[123],"for":[124,179],"CDS.":[125],"this":[127,135],"paper,":[128],"we":[129,165],"propose":[130,177],"initial":[132],"solution":[133],"problem":[136],"by":[137],"formulating":[138],"it":[139,200],"variant":[142],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">Set":[147],"Cover":[148,175],"Problem</i>,":[149],"where":[150],"substrings":[151],"represent":[152],"elements":[154],"be":[156],"covered,":[157],"serve":[160],"candidate":[162],"sets.":[163],"Specifically,":[164],"establish":[166],"connection":[169],"Set":[174],"Problem,":[176],"algorithms":[178],"constructing":[180],"representations,":[183],"demonstrate":[185],"their":[186],"in":[188,212,243],"avoiding":[189],"scenarios":[191],"while":[192],"minimizing":[193],"memory":[194,213],"usage.":[195],"From":[196],"our":[197],"experimental":[198],"results":[199],"turns":[201],"out":[202],"proposed":[205],"optimization":[206],"framework":[207],"achieves":[208],"significant":[210],"reduction":[211],"usage,":[214],"sizes":[218],"reduced":[219],"from":[220,235],"12.7%":[221],"83.5%,":[223],"compared":[224],"existing":[226],"methods.":[227],"Additionally,":[228],"optimized":[230],"improves":[232],"search":[233],"speed":[234],"55.1%":[236],"86.2%,":[238],"highlighting":[239],"practical":[241],"utility":[242],"substring":[245],"search.":[246]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-25T15:57:00.446498","created_date":"2026-01-21T00:00:00"}