{"id":"https://openalex.org/W1871674993","doi":"https://doi.org/10.1142/s1793830915500329","title":"New algorithms for pattern matching with wildcards and length constraints","display_name":"New algorithms for pattern matching with wildcards and length constraints","publication_year":2015,"publication_date":"2015-06-22","ids":{"openalex":"https://openalex.org/W1871674993","doi":"https://doi.org/10.1142/s1793830915500329","mag":"1871674993"},"language":"en","primary_location":{"id":"doi:10.1142/s1793830915500329","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830915500329","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072963545","display_name":"Abdullah N. Arslan","orcid":"https://orcid.org/0000-0002-3979-6371"},"institutions":[{"id":"https://openalex.org/I206651237","display_name":"Texas A&M University \u2013 Commerce","ror":"https://ror.org/01red3556","country_code":"US","type":"education","lineage":["https://openalex.org/I206651237"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Abdullah N. Arslan","raw_affiliation_strings":["Texas A&M University\u2013Commerce, TX 75428, USA"],"affiliations":[{"raw_affiliation_string":"Texas A&M University\u2013Commerce, TX 75428, USA","institution_ids":["https://openalex.org/I206651237"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031414656","display_name":"Betsy George","orcid":null},"institutions":[{"id":"https://openalex.org/I57053284","display_name":"Rockwell Automation (United States)","ror":"https://ror.org/01sx1pm50","country_code":"US","type":"company","lineage":["https://openalex.org/I57053284"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Betsy George","raw_affiliation_strings":["Rockwell Collins, Cedar Rapids, IA 52498, USA"],"affiliations":[{"raw_affiliation_string":"Rockwell Collins, Cedar Rapids, IA 52498, USA","institution_ids":["https://openalex.org/I57053284"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072223757","display_name":"Kirsten Stor","orcid":null},"institutions":[{"id":"https://openalex.org/I191114373","display_name":"University of Wisconsin\u2013Stevens Point","ror":"https://ror.org/05sv6pg41","country_code":"US","type":"education","lineage":["https://openalex.org/I191114373"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kirsten Stor","raw_affiliation_strings":["University of Wisconsin\u2013Stevens Point, Stevens Point, WI 54481, USA","University of Wisconsin-Stevens Point, Stevens Point, WI 54481, USA"],"affiliations":[{"raw_affiliation_string":"University of Wisconsin\u2013Stevens Point, Stevens Point, WI 54481, USA","institution_ids":["https://openalex.org/I191114373"]},{"raw_affiliation_string":"University of Wisconsin-Stevens Point, Stevens Point, WI 54481, USA","institution_ids":["https://openalex.org/I191114373"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5072963545"],"corresponding_institution_ids":["https://openalex.org/I206651237"],"apc_list":null,"apc_paid":null,"fwci":0.4314,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.75428985,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"07","issue":"03","first_page":"1550032","last_page":"1550032"},"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/T11567","display_name":"semigroups and automata theory","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9872999787330627,"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/time-complexity","display_name":"Time complexity","score":0.6387144327163696},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6088036894798279},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5667022466659546},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5403686761856079},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5180028080940247},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5156297087669373},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.481711208820343},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42067813873291016},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2858831286430359}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6387144327163696},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6088036894798279},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5667022466659546},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5403686761856079},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5180028080940247},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5156297087669373},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.481711208820343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42067813873291016},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2858831286430359},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s1793830915500329","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s1793830915500329","pdf_url":null,"source":{"id":"https://openalex.org/S178434951","display_name":"Discrete Mathematics Algorithms and Applications","issn_l":"1793-8309","issn":["1793-8309","1793-8317"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Mathematics, Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W2000733920","https://openalex.org/W2011039300","https://openalex.org/W2044306058","https://openalex.org/W2057804984","https://openalex.org/W2069323107","https://openalex.org/W2151077154","https://openalex.org/W4213060235","https://openalex.org/W4253845860","https://openalex.org/W4300550233","https://openalex.org/W4301808069"],"related_works":["https://openalex.org/W1972035260","https://openalex.org/W2794488505","https://openalex.org/W4301594054","https://openalex.org/W3125889879","https://openalex.org/W3124422538","https://openalex.org/W2295467472","https://openalex.org/W3046451053","https://openalex.org/W2011675579","https://openalex.org/W1589381382","https://openalex.org/W961142965"],"abstract_inverted_index":{"The":[0],"pattern":[1],"matching":[2],"with":[3,71],"wildcards":[4],"and":[5,36,99],"length":[6],"constraints":[7],"problem":[8,12,57],"is":[9,19],"an":[10,43,66],"interesting":[11],"in":[13],"the":[14,47,56,84,89],"literature":[15],"whose":[16],"computational":[17],"complexity":[18,77],"still":[20],"open.":[21],"There":[22,32],"are":[23,33],"polynomial":[24,102],"time":[25,76,103],"exact":[26,86],"algorithms":[27,38],"for":[28,58,68,88],"its":[29],"special":[30,53],"cases.":[31],"heuristic":[34],"algorithms,":[35],"online":[37],"that":[39],"do":[40],"not":[41],"guarantee":[42],"optimal":[44],"solution":[45],"to":[46,79],"original":[48],"problem.":[49],"We":[50,64,82],"consider":[51],"two":[52],"cases":[54],"of":[55],"which":[59],"we":[60],"develop":[61],"offline":[62],"solutions.":[63],"give":[65],"algorithm":[67,87,93],"one":[69],"case":[70,75],"provably":[72],"better":[73],"worst":[74],"compared":[78],"existing":[80],"algorithms.":[81],"present":[83],"first":[85],"second":[90],"case.":[91],"This":[92],"uses":[94],"integer":[95],"linear":[96],"programming":[97],"(ILP)":[98],"it":[100],"takes":[101],"under":[104],"certain":[105],"conditions.":[106]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}