{"id":"https://openalex.org/W2119516497","doi":"https://doi.org/10.1109/cit.2008.4594773","title":"A new parameterized string matching algorithm by combining bit-parallelism and suffix automata","display_name":"A new parameterized string matching algorithm by combining bit-parallelism and suffix automata","publication_year":2008,"publication_date":"2008-07-01","ids":{"openalex":"https://openalex.org/W2119516497","doi":"https://doi.org/10.1109/cit.2008.4594773","mag":"2119516497"},"language":"en","primary_location":{"id":"doi:10.1109/cit.2008.4594773","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cit.2008.4594773","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 8th IEEE International Conference on Computer and Information Technology","raw_type":"proceedings-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/A5057941088","display_name":"Rajesh Prasad","orcid":"https://orcid.org/0000-0002-3456-6980"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Rajesh Prasad","raw_affiliation_strings":["LDC Institute of Technical Studies, Allahabad, India","LDC Inst. of Tech. Studies, Allahabad"],"affiliations":[{"raw_affiliation_string":"LDC Institute of Technical Studies, Allahabad, India","institution_ids":[]},{"raw_affiliation_string":"LDC Inst. of Tech. Studies, Allahabad","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102079330","display_name":"Suneeta Agarwal","orcid":null},"institutions":[{"id":"https://openalex.org/I152869788","display_name":"Motilal Nehru National Institute of Technology","ror":"https://ror.org/04dp7tp96","country_code":"IN","type":"education","lineage":["https://openalex.org/I152869788"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Suneeta Agarwal","raw_affiliation_strings":["Motilal Nehru National Institute of Technology, Allahabad, India","Motilal Nehru National Institute of Technology, Allahabad, India-211003"],"affiliations":[{"raw_affiliation_string":"Motilal Nehru National Institute of Technology, Allahabad, India","institution_ids":["https://openalex.org/I152869788"]},{"raw_affiliation_string":"Motilal Nehru National Institute of Technology, Allahabad, India-211003","institution_ids":["https://openalex.org/I152869788"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5057941088"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0044,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.93720451,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"778","last_page":"783"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9998000264167786,"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.9998000264167786,"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.9993000030517578,"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/T11567","display_name":"semigroups and automata theory","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.8500264883041382},{"id":"https://openalex.org/keywords/substring","display_name":"Substring","score":0.652198314666748},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5828375220298767},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5806920528411865},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.5780120491981506},{"id":"https://openalex.org/keywords/compressed-suffix-array","display_name":"Compressed suffix array","score":0.5656635761260986},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.5576507449150085},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.5319346189498901},{"id":"https://openalex.org/keywords/deterministic-finite-automaton","display_name":"Deterministic finite automaton","score":0.49325889348983765},{"id":"https://openalex.org/keywords/suffix","display_name":"Suffix","score":0.471139132976532},{"id":"https://openalex.org/keywords/boyer\u2013moore-string-search-algorithm","display_name":"Boyer\u2013Moore string search algorithm","score":0.46302786469459534},{"id":"https://openalex.org/keywords/approximate-string-matching","display_name":"Approximate string matching","score":0.43849143385887146},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.4366612136363983},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.4193362891674042},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.37986016273498535},{"id":"https://openalex.org/keywords/commentz-walter-algorithm","display_name":"Commentz-Walter algorithm","score":0.37969595193862915},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33588865399360657},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3142441213130951},{"id":"https://openalex.org/keywords/data-structure","display_name":"Data structure","score":0.20844176411628723},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07796874642372131},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.06337425112724304}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.8500264883041382},{"id":"https://openalex.org/C182407805","wikidata":"https://www.wikidata.org/wiki/Q2626534","display_name":"Substring","level":3,"score":0.652198314666748},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5828375220298767},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5806920528411865},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.5780120491981506},{"id":"https://openalex.org/C100903775","wikidata":"https://www.wikidata.org/wiki/Q5157028","display_name":"Compressed suffix array","level":4,"score":0.5656635761260986},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.5576507449150085},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5319346189498901},{"id":"https://openalex.org/C104091681","wikidata":"https://www.wikidata.org/wiki/Q837528","display_name":"Deterministic finite automaton","level":3,"score":0.49325889348983765},{"id":"https://openalex.org/C2779804580","wikidata":"https://www.wikidata.org/wiki/Q102047","display_name":"Suffix","level":2,"score":0.471139132976532},{"id":"https://openalex.org/C80701825","wikidata":"https://www.wikidata.org/wiki/Q895984","display_name":"Boyer\u2013Moore string search algorithm","level":5,"score":0.46302786469459534},{"id":"https://openalex.org/C32610155","wikidata":"https://www.wikidata.org/wiki/Q1798621","display_name":"Approximate string matching","level":3,"score":0.43849143385887146},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.4366612136363983},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.4193362891674042},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.37986016273498535},{"id":"https://openalex.org/C13052355","wikidata":"https://www.wikidata.org/wiki/Q5152399","display_name":"Commentz-Walter algorithm","level":4,"score":0.37969595193862915},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33588865399360657},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3142441213130951},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.20844176411628723},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07796874642372131},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.06337425112724304},{"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":1,"locations":[{"id":"doi:10.1109/cit.2008.4594773","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cit.2008.4594773","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2008 8th IEEE International Conference on Computer and Information Technology","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1981409766","https://openalex.org/W2013007594","https://openalex.org/W2092587157","https://openalex.org/W2098570717","https://openalex.org/W2099964107","https://openalex.org/W2132265603","https://openalex.org/W2134820505","https://openalex.org/W2134826720","https://openalex.org/W2154864405","https://openalex.org/W2161161814","https://openalex.org/W2611477341","https://openalex.org/W6653654991"],"related_works":["https://openalex.org/W2054173104","https://openalex.org/W2051764263","https://openalex.org/W3145288231","https://openalex.org/W2111239386","https://openalex.org/W2358632292","https://openalex.org/W2390243122","https://openalex.org/W2160046506","https://openalex.org/W1979346480","https://openalex.org/W206460701","https://openalex.org/W2525946144"],"abstract_inverted_index":{"In":[0,139],"the":[1,18,27,32,50,72,173],"parameterized":[2,104,110,148],"string":[3,91,149],"matching,":[4],"a":[5,14,24,144],"given":[6],"pattern":[7],"P":[8,30],"is":[9,130,154,166],"said":[10,62],"to":[11,31,48,63,132],"match":[12],"with":[13],"substring":[15],"t":[16],"of":[17,29,34,55,59,126],"text":[19,134],"T,":[20],"if":[21,66],"there":[22],"exist":[23],"bijection":[25],"from":[26],"symbols":[28,33],"t.":[35],"This":[36,152,164],"problem":[37,93],"has":[38,84,102],"an":[39,86],"important":[40],"application":[41],"in":[42,119,176],"software":[43],"maintenance,":[44],"where":[45],"we":[46,142],"wish":[47],"find":[49],"equivalency":[51],"between":[52],"two":[53],"sections":[54,58],"codes.":[56],"Two":[57],"codes":[60],"are":[61],"be":[64,69],"equivalent,":[65],"one":[67],"can":[68],"transformed":[70],"into":[71],"other":[73],"by":[74],"renaming":[75],"identifiers":[76],"and":[77,109,160],"variables":[78],"only.":[79],"Crochemore":[80],"et":[81,99],"al.,":[82,100],"1994,":[83],"developed":[85,103],"algorithm":[87,106,146,153,165],"(BDM)":[88],"for":[89,147],"exact":[90],"matching":[92,137,150],"using":[94],"suffix":[95,158,174],"automata.":[96],"Kimmo":[97],"Fredriksson":[98],"2006,":[101],"bit-parallel":[105],"(parameterized":[107],"shift-or)":[108],"BDM":[111],"(PBDM).":[112],"Parameterized":[113],"shift-or":[114],"(PSO)":[115],"simulates":[116],"finite":[117],"automata":[118,159,175],"their":[120,177],"nondeterministic":[121],"form.":[122,179],"The":[123],"main":[124],"drawback":[125],"PSO":[127],"is:":[128],"it":[129,171],"unable":[131],"skip":[133],"characters":[135],"while":[136],"forward.":[138],"this":[140],"paper,":[141],"develop":[143],"new":[145],"problem.":[151],"based":[155],"upon":[156],"both":[157],"bit":[161],"parallelism":[162],"concepts.":[163],"faster":[167],"than":[168],"PBDM,":[169],"since":[170],"processes":[172],"non-deterministic":[178]},"counts_by_year":[{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}