{"id":"https://openalex.org/W2167031307","doi":"https://doi.org/10.5120/1758-2397","title":"Novel Devaki Paul Algorithm for Multiple Pattern Matching","display_name":"Novel Devaki Paul Algorithm for Multiple Pattern Matching","publication_year":2011,"publication_date":"2011-01-12","ids":{"openalex":"https://openalex.org/W2167031307","doi":"https://doi.org/10.5120/1758-2397","mag":"2167031307"},"language":"en","primary_location":{"id":"doi:10.5120/1758-2397","doi":"https://doi.org/10.5120/1758-2397","is_oa":true,"landing_page_url":"https://doi.org/10.5120/1758-2397","pdf_url":"https://doi.org/10.5120/1758-2397","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/1758-2397","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5054153178","display_name":"Devaki Pendlimarri","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I4405278262","display_name":"Swarnandhra College of Engineering and Technology","ror":"https://ror.org/05h95sj51","country_code":"IN","type":"education","lineage":["https://openalex.org/I4405278262"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Devaki Pendlimarri","raw_affiliation_strings":["Swarnandhra Institute of Engineering and Technology Narsapur -534 280, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Swarnandhra Institute of Engineering and Technology Narsapur -534 280, India","institution_ids":["https://openalex.org/I4405278262"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5054153178"],"corresponding_institution_ids":["https://openalex.org/I4405278262"],"apc_list":null,"apc_paid":null,"fwci":1.2376,"has_fulltext":true,"cited_by_count":6,"citation_normalized_percentile":{"value":0.78576836,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":95},"biblio":{"volume":"12","issue":"3","first_page":"37","last_page":"42"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.8901000022888184,"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":0.8901000022888184,"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.1096000000834465,"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.8220000267028809},{"id":"https://openalex.org/keywords/boyer-moore-algorithm","display_name":"Boyer-Moore algorithm","score":0.8320000171661377},{"id":"https://openalex.org/keywords/network-intrusion-detection","display_name":"network intrusion detection","score":0.8069999814033508},{"id":"https://openalex.org/keywords/network-security","display_name":"network security","score":0.7860000133514404},{"id":"https://openalex.org/keywords/string-matching","display_name":"string matching","score":0.42899999022483826},{"id":"https://openalex.org/keywords/algorithm-comparison","display_name":"algorithm comparison","score":0.699999988079071}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8854355812072754},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.47695863246917725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4430096745491028},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.047159790992736816},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.03536224365234375}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.5120/1758-2397","doi":"https://doi.org/10.5120/1758-2397","is_oa":true,"landing_page_url":"https://doi.org/10.5120/1758-2397","pdf_url":"https://doi.org/10.5120/1758-2397","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.206.5190","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.206.5190","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ijcaonline.org/volume13/number3/pxc3872397.pdf","raw_type":"text"}],"best_oa_location":{"id":"doi:10.5120/1758-2397","doi":"https://doi.org/10.5120/1758-2397","is_oa":true,"landing_page_url":"https://doi.org/10.5120/1758-2397","pdf_url":"https://doi.org/10.5120/1758-2397","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/W2167031307.pdf","grobid_xml":"https://content.openalex.org/works/W2167031307.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W650499023","https://openalex.org/W1507645144","https://openalex.org/W1529205966","https://openalex.org/W1609518033","https://openalex.org/W1985108724","https://openalex.org/W2045821558","https://openalex.org/W2127711845","https://openalex.org/W2134826720","https://openalex.org/W2460736511","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2127711845","https://openalex.org/W2146990741","https://openalex.org/W2386085015","https://openalex.org/W2112929834","https://openalex.org/W2342097541","https://openalex.org/W2366381853","https://openalex.org/W3150648661","https://openalex.org/W2381624012","https://openalex.org/W2001669800","https://openalex.org/W2030610338"],"abstract_inverted_index":{"Pattern":[0,201],"matching":[1,45],"is":[2,37,66,85,139,160,208],"one":[3],"of":[4,11,136,153,171,193,202,226],"the":[5,9,28,79,90,105,119,129,134,148,174,196,220,223,227,230],"major":[6],"issues":[7],"in":[8,16,21,47,57,59,70,93,229],"area":[10],"network":[12,22],"security":[13],"and":[14,24,115,126,128,147,166,177,186,199,212],"also":[15,117],"many":[17,71],"other":[18],"areas.The":[19],"increase":[20],"speed":[23],"traffic":[25],"may":[26],"cause":[27],"existing":[29],"algorithms":[30,56,215],"to":[31,40,49,88,104,111],"become":[32],"a":[33,101],"performance":[34,135,159,207],"bottleneck.Therefore,":[35],"it":[36,84,113],"very":[38,86],"necessary":[39,87],"develop":[41],"more":[42],"efficient":[43,114],"pattern":[44,81,121,228],"algorithm,":[46],"order":[48],"overcome":[50],"troubles":[51],"on":[52],"performance.There":[53],"are":[54,99],"several":[55],"use,":[58],"which,":[60],"DP":[61,106,137],"algorithm":[62,74,107,123,138,143],"(Devaki":[63,108],"-Paul":[64,109],"algorithm)":[65,110,146],"yielding":[67],"good":[68],"results":[69,130],"cases.However,":[72],"this":[73,96],"was":[75,124],"proposed":[76],"only":[77],"for":[78,118],"single":[80],"matching.But,":[82],"now-a-days":[83],"find":[89],"multiple":[91,120],"patterns":[92],"NIDS":[94],"etc.In":[95],"paper,":[97],"we":[98],"giving":[100],"new":[102],"proposal":[103],"make":[112],"works":[116],"matching.The":[122],"tested":[125],"validated":[127],"have":[131],"proved":[132],"that":[133],"better":[140],"than":[141,162,182,210],"BM":[142,165,185,211],"(Boyer":[144],"-Moore":[145],"Quick":[149,167,189,213],"Search":[150,168,190,214],"algorithm.In":[151],"case":[152,170,192],"tests":[154,172,194],"with":[155,164,173,184,188,195,216],"repeated":[156],"character,":[157],"its":[158,206],"greater":[161,181,209],"1%~50%":[163],"algorithms.In":[169,191],"English":[175,197],"Text":[176,198],"Random":[178,200],"Pattern,":[179],"it's":[180],"33%~91%":[183],"37%~85%":[187],"an":[203],"unsuccessful":[204],"search,":[205],"100%,":[217],"if":[218],"either":[219],"first":[221],"and/or":[222],"last":[224],"character":[225],"given":[231],"text":[232],"were":[233],"not":[234],"present.":[235]},"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}