{"id":"https://openalex.org/W159186547","doi":null,"title":"Multiple Skip Multiple Pattern Matching Algorithm (MSMPMA)","display_name":"Multiple Skip Multiple Pattern Matching Algorithm (MSMPMA)","publication_year":2007,"publication_date":"2007-01-01","ids":{"openalex":"https://openalex.org/W159186547","mag":"159186547"},"language":"en","primary_location":{"id":"mag:159186547","doi":null,"is_oa":false,"landing_page_url":"http://www.iaeng.org/IJCS/issues_v34/issue_2/IJCS_34_2_03.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"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":"https://openalex.org/A5068898194","display_name":"Musbah M. Aqel","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Musbah M. Aqel","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5041089410","display_name":"M M Ibrahiem","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M M Ibrahiem","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2669,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.5178282,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":97},"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/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/T12288","display_name":"Optimization and Search Problems","score":0.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"}}],"keywords":[{"id":"https://openalex.org/keywords/multiple-pattern-matching","display_name":"multiple pattern matching","score":0.949999988079071},{"id":"https://openalex.org/keywords/string-matching","display_name":"string matching","score":0.503000020980835},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.5130000114440918},{"id":"https://openalex.org/keywords/comparison-reduction","display_name":"comparison reduction","score":0.546999990940094}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6907526254653931},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6571944952011108},{"id":"https://openalex.org/C75165309","wikidata":"https://www.wikidata.org/wiki/Q2258979","display_name":"Search engine indexing","level":2,"score":0.6506530046463013},{"id":"https://openalex.org/C34736171","wikidata":"https://www.wikidata.org/wiki/Q918333","display_name":"Preprocessor","level":2,"score":0.6318603157997131},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6186270117759705},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.6088343858718872},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5762248039245605},{"id":"https://openalex.org/C61455927","wikidata":"https://www.wikidata.org/wiki/Q1030529","display_name":"Blossom algorithm","level":3,"score":0.4801461398601532},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.47032487392425537},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.4688732922077179},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.4213995039463043},{"id":"https://openalex.org/C153180895","wikidata":"https://www.wikidata.org/wiki/Q7148389","display_name":"Pattern recognition (psychology)","level":2,"score":0.36290085315704346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2146719992160797},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2140273153781891},{"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:159186547","doi":null,"is_oa":false,"landing_page_url":"http://www.iaeng.org/IJCS/issues_v34/issue_2/IJCS_34_2_03.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"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":14,"referenced_works":["https://openalex.org/W124244495","https://openalex.org/W1529205966","https://openalex.org/W1551666721","https://openalex.org/W1577337656","https://openalex.org/W1609518033","https://openalex.org/W1674877186","https://openalex.org/W1986106281","https://openalex.org/W2030333135","https://openalex.org/W2045821558","https://openalex.org/W2055043387","https://openalex.org/W2099964107","https://openalex.org/W2116967744","https://openalex.org/W2134826720","https://openalex.org/W2460736511"],"related_works":["https://openalex.org/W7096181939","https://openalex.org/W124244495","https://openalex.org/W3088486764","https://openalex.org/W2387636447","https://openalex.org/W3150648661","https://openalex.org/W7100762776","https://openalex.org/W2035593393","https://openalex.org/W7100626794","https://openalex.org/W2358697068","https://openalex.org/W2007369275"],"abstract_inverted_index":{"A":[0],"new":[1],"algorithm":[2,75,96,135],"to":[3,51,107],"search":[4,26,63],"for":[5,81,122],"multiple":[6,12,82,123],"patterns":[7,83],"simultaneously":[8],"is":[9,59,65,71,76,97],"proposed.":[10],"The":[11,73,91,111,134],"pattern":[13,33],"algorithms":[14,145],"can":[15,35,79],"be":[16,36,127],"used":[17,37],"in":[18,38,45,85,152],"many":[19],"applications":[20,47],"that":[21,48,60],"require":[22],"such":[23],"type":[24],"of":[25,40,56,94,102,113],"and":[27,67,78,121,138,146,154],"matching.":[28],"For":[29],"example,":[30],"a":[31,86],"multi-":[32],"matching":[34,84,144],"lieu":[39],"indexing":[41],"or":[42],"sorting":[43],"data":[44],"some":[46,141],"involve":[49],"small":[50],"medium":[52],"size":[53],"datasets.":[54],"One":[55],"its":[57],"advantages":[58],"no":[61,68],"additional":[62],"structure":[64],"needed":[66],"preprocessing":[69],"phase":[70],"required.":[72],"proposed":[74],"simple":[77],"suit":[80],"file":[87],"with":[88,140],"unlimited":[89],"size.":[90],"time":[92],"complexity":[93],"the":[95,103,118],"O":[98,109],"(n*m),":[99],"but":[100],"because":[101],"skips":[104],"it":[105,125,147],"moves":[106],"around":[108],"(n).":[110],"number":[112],"comparisons":[114],"rapidly":[115],"decreased":[116],"after":[117],"first":[119],"match,":[120],"matching,":[124],"will":[126],"little":[128],"greater":[129],"than":[130,156],"n":[131],"(file":[132],"size).":[133],"was":[136],"implemented":[137],"compared":[139],"popular":[142],"multi-pattern":[143],"has":[148],"shown":[149],"more":[150],"enhancement":[151],"performance":[153],"faster":[155],"others.":[157]},"counts_by_year":[{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":3},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T04:12:42.849631","created_date":"2016-06-24T00:00:00"}