{"id":"https://openalex.org/W1517097234","doi":"https://doi.org/10.1016/j.tcs.2022.04.009","title":"On the average-case complexity of pattern matching with wildcards","display_name":"On the average-case complexity of pattern matching with wildcards","publication_year":2022,"publication_date":"2022-04-12","ids":{"openalex":"https://openalex.org/W1517097234","doi":"https://doi.org/10.1016/j.tcs.2022.04.009","mag":"1517097234"},"language":"en","primary_location":{"id":"doi:10.1016/j.tcs.2022.04.009","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2022.04.009","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://doi.org/10.1016/j.tcs.2022.04.009","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5039166412","display_name":"Carl Barton","orcid":"https://orcid.org/0000-0001-6938-9446"},"institutions":[{"id":"https://openalex.org/I98259816","display_name":"Birkbeck, University of London","ror":"https://ror.org/02mb95055","country_code":"GB","type":"education","lineage":["https://openalex.org/I124357947","https://openalex.org/I98259816"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Carl Barton","raw_affiliation_strings":["Birkbeck, University of London, Malet St, Bloomsbury, London WC1E 7HX, United Kingdom of Great Britain and Northern Ireland"],"raw_orcid":"https://orcid.org/0000-0001-6938-9446","affiliations":[{"raw_affiliation_string":"Birkbeck, University of London, Malet St, Bloomsbury, London WC1E 7HX, United Kingdom of Great Britain and Northern Ireland","institution_ids":["https://openalex.org/I98259816"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039166412"],"corresponding_institution_ids":["https://openalex.org/I98259816"],"apc_list":{"value":2690,"currency":"USD","value_usd":2690},"apc_paid":{"value":2690,"currency":"USD","value_usd":2690},"fwci":0.2775,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.60057143,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"922","issue":null,"first_page":"37","last_page":"45"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998999834060669,"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.9998999834060669,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.9973000288009644,"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.994700014591217,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6367284059524536},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.593438982963562},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.593002200126648},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.5609245300292969},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5297164916992188},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.4926069378852844},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.48693597316741943},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.4781031012535095},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4626774191856384},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.446171373128891},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4210435748100281},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23336374759674072},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.12588226795196533},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11697125434875488}],"concepts":[{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6367284059524536},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.593438982963562},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.593002200126648},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.5609245300292969},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5297164916992188},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4926069378852844},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.48693597316741943},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.4781031012535095},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4626774191856384},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.446171373128891},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4210435748100281},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23336374759674072},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.12588226795196533},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11697125434875488},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1016/j.tcs.2022.04.009","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2022.04.009","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:eprints.bbk.ac.uk.oai2:48011","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400466","display_name":"BIROn (Birkbeck, University of London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98259816","host_organization_name":"Birkbeck, University of London","host_organization_lineage":["https://openalex.org/I98259816"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":null,"raw_type":"PeerReviewed"}],"best_oa_location":{"id":"doi:10.1016/j.tcs.2022.04.009","is_oa":true,"landing_page_url":"https://doi.org/10.1016/j.tcs.2022.04.009","pdf_url":null,"source":{"id":"https://openalex.org/S90727058","display_name":"Theoretical Computer Science","issn_l":"0304-3975","issn":["0304-3975","1879-2294"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W31845482","https://openalex.org/W175303005","https://openalex.org/W192132774","https://openalex.org/W1513153538","https://openalex.org/W1514735749","https://openalex.org/W1515839227","https://openalex.org/W1541021594","https://openalex.org/W1563441842","https://openalex.org/W1582663883","https://openalex.org/W1602808498","https://openalex.org/W1964432965","https://openalex.org/W1964638897","https://openalex.org/W1985108724","https://openalex.org/W1992020000","https://openalex.org/W1996113955","https://openalex.org/W2011996797","https://openalex.org/W2047203512","https://openalex.org/W2049842402","https://openalex.org/W2067130606","https://openalex.org/W2067386559","https://openalex.org/W2071461587","https://openalex.org/W2072193858","https://openalex.org/W2081407605","https://openalex.org/W2083983739","https://openalex.org/W2085218027","https://openalex.org/W2106889224","https://openalex.org/W2109766452","https://openalex.org/W2122282348","https://openalex.org/W2153517105","https://openalex.org/W2159681295","https://openalex.org/W2175677593","https://openalex.org/W2788159478","https://openalex.org/W2911839478","https://openalex.org/W2950603471","https://openalex.org/W4239915572","https://openalex.org/W6601262889","https://openalex.org/W6635836129","https://openalex.org/W6638455608","https://openalex.org/W6649303037","https://openalex.org/W6655881589","https://openalex.org/W6671336696","https://openalex.org/W6671717367","https://openalex.org/W6676702273","https://openalex.org/W6682921480"],"related_works":["https://openalex.org/W4323060013","https://openalex.org/W2359478580","https://openalex.org/W1831618889","https://openalex.org/W2351290558","https://openalex.org/W1994727264","https://openalex.org/W2048532915","https://openalex.org/W1521382282","https://openalex.org/W2122048245","https://openalex.org/W2569824749","https://openalex.org/W2284834235"],"abstract_inverted_index":{"Pattern":[0],"matching":[1,7,56,106,120,123],"with":[2,9,107,124,180],"wildcards":[3,32,58,74,108,179],"is":[4,134,192,204],"a":[5,17,25,45,111,131,157,171],"string":[6,132,158],"problem":[8],"the":[10,62,65,71,78,84,97,101,128,135,138,151,154,164,181],"goal":[11],"of":[12,16,20,28,47,87,104,130,137,153,156,174,183],"finding":[13],"all":[14],"factors":[15],"text":[18,79],"t":[19],"length":[21,29,152,175,184],"n":[22],"that":[23,34],"match":[24,35],"pattern":[26,55,105,119,122,172],"x":[27,159,173],"m,":[30],"where":[31,57,73,142],"(characters":[33],"everything)":[36],"may":[37],"be":[38],"present.":[39],"In":[40],"this":[41],"paper":[42],"we":[43],"present":[44],"number":[46],"complexity":[48,86,103,116],"results":[49,66,99,166],"and":[50,90,121,146,170,177],"fast":[51],"average-case":[52,85,102],"algorithms":[53,89],"for":[54,167],"are":[59,67,75,96],"allowed":[60,76],"in":[61,77,114,197,208],"pattern,":[63],"however,":[64],"easily":[68],"adapted":[69],"to":[70],"case":[72],"as":[80],"well.":[81],"We":[82,126,149,162],"analyse":[83],"these":[88],"derive":[91],"non-trivial":[92],"time":[93,115],"bounds.":[94],"These":[95],"first":[98],"on":[100,199,210,220],"which":[109,133],"provide":[110],"provable":[112],"separation":[113],"between":[117],"exact":[118],"wildcards.":[125],"introduce":[127],"wc-period":[129,155],"period":[136],"binary":[139],"mask":[140],"xb":[141],"xb[i]=a":[143],"iff":[144],"x[i]\u2260\u03d5":[145],"b":[147],"otherwise.":[148],"denote":[150],"by":[160],".":[161],"show":[163],"following":[165],"constant":[168],"0<\u03f5<1":[169],"m":[176],"g":[178],"prefix":[182],"p":[185],"contains":[186],"gp":[187],"wildcards:":[188],"If":[189,201,212],"limm\u2192\u221e\u2061gpp=0":[190],"there":[191,203],"an":[193,205],"optimal":[194],"algorithm":[195,206,215],"running":[196,207],"O(nlog\u03c3\u2061mm)-time":[198],"average.":[200,211,221],"limm\u2192\u221e\u2061gpp=1\u2212\u03f5":[202],"O(nlog\u03c3\u2061mlog2\u2061pm)-time":[209],"limm\u2192\u221e\u2061gm=limm\u2192\u221e\u20611\u2212f(m)=1":[213],"any":[214],"takes":[216],"at":[217],"least":[218],"\u03a9(nlog\u03c3\u2061mf(m))-time":[219]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}