{"id":"https://openalex.org/W2358898466","doi":null,"title":"An Efficient Multiple Patterns String Matching Algorithm","display_name":"An Efficient Multiple Patterns String Matching Algorithm","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W2358898466","mag":"2358898466"},"language":"en","primary_location":{"id":"mag:2358898466","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-JSJC201403068.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764825856","display_name":"Jisuanji gongcheng","issn_l":"1000-3428","issn":["1000-3428"],"is_oa":false,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","poland-20"],"host_organization":"https://openalex.org/P4361727472","host_organization_name":"East China Computer Technology Research Institute","host_organization_lineage":["https://openalex.org/P4361727472"],"host_organization_lineage_names":["East China Computer Technology Research Institute"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Jisuanji gongcheng","raw_type":null},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jiamin Xu","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I184983240","display_name":"Northeast Normal University","ror":"https://ror.org/02rkvz144","country_code":"CN","type":"education","lineage":["https://openalex.org/I184983240"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jiamin Xu","raw_affiliation_strings":["Ideal Research Institute of Information Technology,Northeast Normal University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Ideal Research Institute of Information Technology,Northeast Normal University","institution_ids":["https://openalex.org/I184983240"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I184983240"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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/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"}},{"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"}}],"keywords":[{"id":"https://openalex.org/keywords/state-transitions","display_name":"state transitions","score":0.4440000057220459}],"concepts":[{"id":"https://openalex.org/C13052355","wikidata":"https://www.wikidata.org/wiki/Q5152399","display_name":"Commentz-Walter algorithm","level":4,"score":0.8968918919563293},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8305879831314087},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.8008147478103638},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.7781969308853149},{"id":"https://openalex.org/C80701825","wikidata":"https://www.wikidata.org/wiki/Q895984","display_name":"Boyer\u2013Moore string search algorithm","level":5,"score":0.7115383744239807},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5827341079711914},{"id":"https://openalex.org/C75930677","wikidata":"https://www.wikidata.org/wiki/Q1251950","display_name":"Ramer\u2013Douglas\u2013Peucker algorithm","level":3,"score":0.5711331963539124},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4866984188556671},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4632837176322937},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.45488882064819336},{"id":"https://openalex.org/C109111794","wikidata":"https://www.wikidata.org/wiki/Q730933","display_name":"Dinic's algorithm","level":5,"score":0.4504169821739197},{"id":"https://openalex.org/C32610155","wikidata":"https://www.wikidata.org/wiki/Q1798621","display_name":"Approximate string matching","level":3,"score":0.4326571822166443},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.42695263028144836},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.16080889105796814},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14021432399749756},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.09281694889068604},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"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/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.0},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"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":"mag:2358898466","doi":null,"is_oa":false,"landing_page_url":"http://en.cnki.com.cn/Article_en/CJFDTOTAL-JSJC201403068.htm","pdf_url":null,"source":{"id":"https://openalex.org/S2764825856","display_name":"Jisuanji gongcheng","issn_l":"1000-3428","issn":["1000-3428"],"is_oa":false,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","poland-20"],"host_organization":"https://openalex.org/P4361727472","host_organization_name":"East China Computer Technology Research Institute","host_organization_lineage":["https://openalex.org/P4361727472"],"host_organization_lineage_names":["East China Computer Technology Research Institute"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Jisuanji gongcheng","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2364423341","https://openalex.org/W1976129744","https://openalex.org/W2374626535","https://openalex.org/W2378973059","https://openalex.org/W2389961636","https://openalex.org/W2364430766","https://openalex.org/W2360285228","https://openalex.org/W1991731883","https://openalex.org/W1552046427","https://openalex.org/W2380261304"],"abstract_inverted_index":{"Combined":[0],"with":[1],"the":[2,23,29,34,55,61,66,75,85,95,98,101,105],"advantages":[3],"of":[4,25,31,36,54],"BM-Horspool(BMH)":[5],"algorithm":[6,11,39,68,77,87],"and":[7,46,57,78],"Quick-Search(QS)":[8],"algorithm,an":[9],"effective":[10],"to":[12,88],"perform":[13],"multiple":[14],"patterns":[15],"matching":[16],"in":[17],"a":[18,90],"string":[19,91],"is":[20,92],"proposed":[21,38,67,86],"on":[22],"concept":[24],"Fan-Su(FS)":[26],"algorithm.To":[27],"reduce":[28],"number":[30],"comparisons,and":[32],"improve":[33],"efficiency":[35],"matching,the":[37],"skips":[40],"as":[41,44],"many":[42],"characters":[43],"possible":[45],"avoids":[47],"useless":[48],"state":[49],"transitions,by":[50],"making":[51],"full":[52],"use":[53],"successful":[56],"failing":[58],"information":[59],"during":[60],"matching.Experimental":[62],"results":[63],"show":[64],"that":[65],"can":[69],"achieve":[70],"more":[71],"excellent":[72],"performance":[73],"than":[74],"ACBM":[76,99],"FS":[79,102],"algorithm.The":[80],"time":[81],"it":[82],"takes":[83],"for":[84],"search":[89],"only":[93],"10%~35%of":[94],"AC":[96],"algorithm,50%~60%of":[97],"algorithm,70%of":[100],"algorithm,and":[103],"65%of":[104],"FSQB":[106],"algorithm.":[107]},"counts_by_year":[],"updated_date":"2026-09-27T08:07:27.782135","created_date":"2016-06-24T00:00:00"}