{"id":"https://openalex.org/W2103922869","doi":"https://doi.org/10.5120/13006-0312","title":"Approximate Multiple Pattern String Matching using Bit Parallelism: A Review","display_name":"Approximate Multiple Pattern String Matching using Bit Parallelism: A Review","publication_year":2013,"publication_date":"2013-07-30","ids":{"openalex":"https://openalex.org/W2103922869","doi":"https://doi.org/10.5120/13006-0312","mag":"2103922869"},"language":"en","primary_location":{"id":"doi:10.5120/13006-0312","doi":"https://doi.org/10.5120/13006-0312","is_oa":true,"landing_page_url":"http://doi.org/10.5120/13006-0312","pdf_url":"https://doi.org/10.5120/13006-0312","source":{"id":"https://openalex.org/S4210206007","display_name":"International Journal of Computer Applications","issn_l":"0975-8887","issn":["0975-8887"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4322545532","host_organization_name":"Foundation of Computer Science","host_organization_lineage":["https://openalex.org/P4322545532"],"host_organization_lineage_names":["Foundation of Computer Science"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Applications","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://doi.org/10.5120/13006-0312","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5031407285","display_name":"Syed DanishAli","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Syed DanishAli","raw_affiliation_strings":["Department of Computer Science & Engineering All Saints' College of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering All Saints' College of Technology","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071199686","display_name":"Zuber Farooqui","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zuber Farooqui","raw_affiliation_strings":["Department of Computer Science & Engineering All Saints' College of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering All Saints' College of Technology","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.6622,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.65536332,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":93},"biblio":{"volume":"74","issue":"19","first_page":"47","last_page":"51"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.0,"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.0,"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/approximate-string-matching","display_name":"approximate string matching","score":0.9860000014305115},{"id":"https://openalex.org/keywords/multiple-pattern-matching","display_name":"multiple pattern matching","score":0.8610000014305115},{"id":"https://openalex.org/keywords/bit-parallelism","display_name":"bit-parallelism","score":0.968999981880188},{"id":"https://openalex.org/keywords/aho-corasick-algorithm","display_name":"Aho-Corasick algorithm","score":0.8669999837875366},{"id":"https://openalex.org/keywords/memory-efficiency","display_name":"memory efficiency","score":0.6299999952316284},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.7749999761581421}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.9184984564781189},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.7830259799957275},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.6858399510383606},{"id":"https://openalex.org/C117011727","wikidata":"https://www.wikidata.org/wiki/Q1278488","display_name":"Bit (key)","level":2,"score":0.6026532053947449},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.5836303234100342},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.49487918615341187},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4758303463459015},{"id":"https://openalex.org/C150807984","wikidata":"https://www.wikidata.org/wiki/Q1992074","display_name":"Bit array","level":3,"score":0.4425758123397827},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3810940682888031},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36829453706741333},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.36546000838279724},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.32139283418655396},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2064785659313202},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.06756210327148438},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0649726390838623},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.060209810733795166},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.05785474181175232},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.5120/13006-0312","doi":"https://doi.org/10.5120/13006-0312","is_oa":true,"landing_page_url":"http://doi.org/10.5120/13006-0312","pdf_url":"https://doi.org/10.5120/13006-0312","source":{"id":"https://openalex.org/S4210206007","display_name":"International Journal of Computer Applications","issn_l":"0975-8887","issn":["0975-8887"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4322545532","host_organization_name":"Foundation of Computer Science","host_organization_lineage":["https://openalex.org/P4322545532"],"host_organization_lineage_names":["Foundation of Computer Science"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Applications","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.402.7137","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.402.7137","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.ijcaonline.org/volume76/number15/pxc3890451.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.403.1471","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.403.1471","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.ijcaonline.org/volume74/number19/pxc3890312.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.5120/13006-0312","doi":"https://doi.org/10.5120/13006-0312","is_oa":true,"landing_page_url":"http://doi.org/10.5120/13006-0312","pdf_url":"https://doi.org/10.5120/13006-0312","source":{"id":"https://openalex.org/S4210206007","display_name":"International Journal of Computer Applications","issn_l":"0975-8887","issn":["0975-8887"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core"],"host_organization":"https://openalex.org/P4322545532","host_organization_name":"Foundation of Computer Science","host_organization_lineage":["https://openalex.org/P4322545532"],"host_organization_lineage_names":["Foundation of Computer Science"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Computer Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2103922869.pdf","grobid_xml":"https://content.openalex.org/works/W2103922869.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W206460701","https://openalex.org/W1519856633","https://openalex.org/W1529203176","https://openalex.org/W1847991430","https://openalex.org/W1970659131","https://openalex.org/W1973022026","https://openalex.org/W1980331464","https://openalex.org/W1981409766","https://openalex.org/W2092587157","https://openalex.org/W2096077239","https://openalex.org/W2099964107","https://openalex.org/W4246821206"],"related_works":["https://openalex.org/W7100986241","https://openalex.org/W1516706901","https://openalex.org/W194074889","https://openalex.org/W2137396482","https://openalex.org/W2584060135","https://openalex.org/W1572771982","https://openalex.org/W7096548964","https://openalex.org/W7112323176","https://openalex.org/W2167880804","https://openalex.org/W7096934632"],"abstract_inverted_index":{"String":[0,26],"matching":[1,79],"is":[2,46,60],"to":[3,53,62],"find":[4],"all":[5],"the":[6,29,36,43,57,72,76,84,87,96,106],"occurrences":[7],"of":[8,19,31,38,75,86],"a":[9,13,47],"given":[10],"pattern":[11],"in":[12,64,93],"large":[14],"text":[15,58],"both":[16,121],"being":[17],"sequence":[18],"characters":[20],"drawn":[21],"from":[22],"finite":[23],"alphabet":[24],"set.Approximate":[25],"Matching":[27],"involves":[28],"detection":[30,37],"correct":[32],"patterns":[33,41,55],"along":[34],"with":[35,105],"some":[39],"wrong":[40],"inside":[42,56,95],"text.Bit":[44],"Parallelism":[45],"feature":[48],"that":[49],"can":[50],"be":[51],"used":[52],"detect":[54],"and":[59,115,123],"reported":[61],"result":[63],"more":[65,113],"efficient":[66],"approximate":[67,77],"string":[68,78],"matching.Bit":[69],"parallelism":[70],"enhances":[71],"processing":[73],"speed":[74],"algorithm":[80],"as":[81],"it":[82],"takes":[83],"benefit":[85],"internal":[88],"bit":[89,98,118],"operations":[90],"taking":[91],"place":[92],"parallel":[94,99,119],"system.The":[97],"method":[100],"has":[101],"also":[102],"been":[103],"compared":[104],"traditional":[107],"Aho":[108],"Corasick":[109],"Algorithms":[110],"which":[111],"consumes":[112],"time":[114,124],"memory.In":[116],"general":[117],"are":[120],"memory":[122],"efficient.":[125]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2016-06-24T00:00:00"}