{"id":"https://openalex.org/W2032370917","doi":"https://doi.org/10.1142/s0129054106004388","title":"A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM","display_name":"A SPACE EFFICIENT BIT-PARALLEL ALGORITHM FOR THE MULTIPLE STRING MATCHING PROBLEM","publication_year":2006,"publication_date":"2006-12-01","ids":{"openalex":"https://openalex.org/W2032370917","doi":"https://doi.org/10.1142/s0129054106004388","mag":"2032370917"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054106004388","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054106004388","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","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/A5045684463","display_name":"Domenico Cantone","orcid":"https://orcid.org/0000-0002-1306-1166"},"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":"DOMENICO CANTONE","raw_affiliation_strings":["Dipartimento di Matematica e Informatica, Universit\u00e0 di Catania, Viale A.Doria n.6, Catania, Italy, 95125, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica e Informatica, Universit\u00e0 di Catania, Viale A.Doria n.6, Catania, Italy, 95125, Italy","institution_ids":["https://openalex.org/I39063666"]}]},{"author_position":"last","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":["Dipartimento di Matematica e Informatica, Universit\u00e0 di Catania, Viale A.Doria n.6, Catania, Italy, 95125, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica e Informatica, Universit\u00e0 di Catania, Viale A.Doria n.6, Catania, Italy, 95125, Italy","institution_ids":["https://openalex.org/I39063666"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I39063666"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.09879654,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"17","issue":"06","first_page":"1235","last_page":"1251"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9995999932289124,"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.9995999932289124,"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.9991999864578247,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9987999796867371,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.70590740442276},{"id":"https://openalex.org/keywords/nondeterministic-finite-automaton","display_name":"Nondeterministic finite automaton","score":0.6820240616798401},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.5229169130325317},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5225017666816711},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5039474368095398},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.4763888716697693},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.46788257360458374},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.4392157196998596},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4391062557697296},{"id":"https://openalex.org/keywords/dfa-minimization","display_name":"DFA minimization","score":0.43010950088500977},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.4234990179538727},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.41118869185447693},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39010798931121826},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3726612627506256},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3311206102371216},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.2922831177711487}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.70590740442276},{"id":"https://openalex.org/C158008952","wikidata":"https://www.wikidata.org/wiki/Q617295","display_name":"Nondeterministic finite automaton","level":4,"score":0.6820240616798401},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.5229169130325317},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5225017666816711},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5039474368095398},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.4763888716697693},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.46788257360458374},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.4392157196998596},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4391062557697296},{"id":"https://openalex.org/C65753522","wikidata":"https://www.wikidata.org/wiki/Q5204896","display_name":"DFA minimization","level":5,"score":0.43010950088500977},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.4234990179538727},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.41118869185447693},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39010798931121826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3726612627506256},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3311206102371216},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.2922831177711487},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/s0129054106004388","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054106004388","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"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":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.5299999713897705,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W185052921","https://openalex.org/W1577337656","https://openalex.org/W1847991430","https://openalex.org/W1981409766","https://openalex.org/W1985108724","https://openalex.org/W1986106281","https://openalex.org/W1992020000","https://openalex.org/W2099964107","https://openalex.org/W2134826720","https://openalex.org/W2293032297","https://openalex.org/W2611477341"],"related_works":["https://openalex.org/W3046613010","https://openalex.org/W341413838","https://openalex.org/W2615308287","https://openalex.org/W1945859206","https://openalex.org/W2083002627","https://openalex.org/W124607232","https://openalex.org/W10282080","https://openalex.org/W2359597723","https://openalex.org/W2013080869","https://openalex.org/W12503799"],"abstract_inverted_index":{"Finite":[0],"(nondeterministic)":[1],"automata":[2,30,50,90,128],"are":[3],"very":[4,54],"useful":[5],"building":[6],"blocks":[7],"in":[8,18,144],"the":[9,19,26,34,40,57,77,84,125],"field":[10],"of":[11,21,28,36,48,87,141],"string":[12,79],"matching.":[13],"This":[14],"is":[15,62],"particularly":[16],"true":[17,65],"case":[20],"multiple":[22,78],"pattern":[23],"matching,":[24],"where":[25],"use":[27],"factor-based":[29,67,89],"can":[31,51],"reduce":[32],"substantially":[33],"number":[35],"computational":[37],"steps":[38],"when":[39],"patterns":[41],"have":[42],"large":[43],"common":[44,142],"factors.":[45],"Direct":[46],"simulation":[47,86],"nondeterministic":[49,88],"be":[52,122],"performed":[53],"efficiently":[55],"using":[56],"bit-parallelism":[58],"technique,":[59],"though":[60],"this":[61,70],"not":[63,137],"necessarily":[64],"for":[66,76],"automata.":[68],"In":[69],"paper":[71],"we":[72],"present":[73],"an":[74],"algorithm":[75],"matching":[80],"problem,":[81],"based":[82],"on":[83],"bit-parallel":[85,132],"which":[91],"satisfy":[92],"a":[93,108],"particular":[94],"ordering":[95],"condition.":[96],"We":[97],"also":[98],"show":[99],"how":[100],"to":[101,121],"enforce":[102],"such":[103],"condition":[104],"by":[105,130],"suitably":[106],"modifying":[107],"minimal":[109],"initial":[110],"automaton,":[111],"through":[112],"equivalence":[113],"preserving":[114],"transformations.":[115],"The":[116],"resulting":[117],"automaton":[118],"turns":[119],"out":[120],"smaller":[123],"than":[124],"corresponding":[126],"maximal":[127],"used":[129],"existing":[131],"algorithms,":[133],"as":[134],"they":[135],"do":[136],"take":[138],"any":[139],"advantage":[140],"factors":[143],"patterns.":[145]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}