42,647 Hits in 5.3 sec

Bit Parallel String Matching Algorithms: A Survey

Sumit Gupta, Akhtar Rasool
2014 International Journal of Computer Applications  
Some of the popular bit parallel string matching algorithms Shift OR, Shift OR with Q-Gram, BNDM, TNDM, SBNDM, LBNDM, FBNDM, BNDMq, and Multiple pattern BNDM.  ...  This paper discusses the working of various bit parallel string matching algorithms with example. Here we present how bit parallelism is useful for efficiency improvement in various algorithms.  ...  Multiple Pattern BNDM BNDM algorithm is a single pattern string matching algorithm which is very fast one because it uses the concept of bit parallelism.  ... 
doi:10.5120/16632-6501 fatcat:ae5v26ljrzcwlg32p22uc5hkvi

Exact Online String Matching Bibliography [article]

Simone Faro
2016 arXiv   pre-print
In this short note we present a comprehensive bibliography for the online exact string matching problem. The problem consists in finding all occurrences of a given pattern in a text.  ...  Since 1970 more than 120 string matching algorithms have been proposed. In this note we present a comprehensive list of (almost) all string matching algorithms. The list is updated to May 2016.  ...  Fast-Search using Multiple Windows (FSw) -2012 Appeared in [51] Improvement of (29) using multiple sliding windows. Windows slides from left to right and from right to left.  ... 
arXiv:1605.05067v1 fatcat:2nr7bjtafjfmjgpfcfbyjnr6oq

A Review of String Matching Algorithms and Recent Implementations using GPU

Rolando Ramos-Frías, Miguel Vargas-Lombardo
2017 International Journal of Security and Its Applications  
In this paper we present a state of the art for the various types of string matching algorithms; and also review recent implementations done in GPU.  ...  The amount of processing required for modern applications that use string matching algorithms has increased over the years and new algorithms and solutions have been developed.  ...  The best performing of these algorithms for multiple patterns search being the Commentz Walter Algorithm.  ... 
doi:10.14257/ijsia.2017.11.6.06 fatcat:movoymjy6bhq7kcj6bhipoefuy

Multiple Methods for Genome Filtering

Alma Husagic Selman
2013 Southeast Europe Journal of Soft Computing  
The algorithm is linear and can be used to search for multiple patterns.  ...  Filters are fast algorithms since they search for the necessary, but not sufficient conditions in order to pass the string (Baeza-Yates & Navarro, 2001).  ... 
doi:10.21533/scjournal.v2i2.24 fatcat:mmee5txzo5ewblzmdo7j4i67yi

Modulated String Searching [article]

Alberto Apostolico, Péter L. Erdős, István Miklós, Johannes Siemons
2013 arXiv   pre-print
The present paper introduces modulated string searching as a unified framework for string matching problems where the numerical conditions can be combined with some Boolean/numerical decision conditions  ...  In his 1987 paper entitled "Generalized String Matching", Abrahamson introduced pattern matching with character classes and provided the first efficient algorithm to solve it.  ...  Acknowledgement We are indebted to Amihood Amir for his encouragement and for enlightening discussions.  ... 
arXiv:1302.3437v2 fatcat:xy2aqmjw4rb4zeguajthh5teqa

Approximate multiple string search [chapter]

Robert Muth, Udi Manber
1996 Lecture Notes in Computer Science  
This paper presents a fast algorithm for searching a large text for multiple strings allowing one error.  ...  On a fast workstation, the algorithm can process a megabyte of text searching for 1000 patterns (with one error) in less than a second.  ...  We have in the past designed and implemented algorithms for fast approximate string searching (agrep [WM92]), and fast multiple string searching ( [WM93] , also available as part of the agrep package)  ... 
doi:10.1007/3-540-61258-0_7 fatcat:wfnmm5aftvfvll7ght3wyv4yb4

Exact String Matching Algorithms: Survey, Issues, and Future Research Directions

Saqib Hakak, Amirrudin Kamsin, Palaiahnakote Shivakumara, Gulshan Amin Gilkar, Wazir Zada Khan, Muhammad Imran
2019 IEEE Access  
This paper presents a survey on single-pattern exact string matching algorithms.  ...  As a result, choosing an appropriate string matching algorithm for current applications and addressing challenges is difficult.  ...  Multiple-pattern matching algorithms are proposed for such applications [28] . 2) MULTIPLE-PATTERN MATCHING Multiple-pattern matching is an advanced version of singlepattern matching.  ... 
doi:10.1109/access.2019.2914071 fatcat:2bkgo6vkjjd63nl2yavplt6gw4

A Fast Regular Expressions Matching Algorithm for NIDS

Meng-meng Zhang, Yan Sun, Jing-zhong Wang
2013 Applied Mathematics & Information Sciences  
In this paper, we propose a new algorithm to accelerate the searching speed in network intrusion detection system (NIDS) and we implement our algorithm in Snort, a popular open-source intrusion detection  ...  The algorithm does not need preprocessing and can check multiple characters in parallel.  ...  Comparison with Boyer-Moore string search algorithm The BoyerCMoore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical  ... 
doi:10.12785/amis/070245 fatcat:6xuvajxuvrcx3acw4xtcavskem

Parallelization of KMP String Matching Algorithm on Different SIMD Architectures: Multi-Core and GPGPU's

Akhtar Rasool, Nilay Khare
2012 International Journal of Computer Applications  
String matching is a classical problem in computer science.  ...  The algorithm is designed to work on SIMD parallel architecture where text is divided for parallel processing and special searching at division point is required for consistent and complete searching.  ...  KMP algorithm for pattern searching.  ... 
doi:10.5120/7672-0963 fatcat:wuspz57c5fbm3dy7uumgk2xqfe

Fast Multiple String Matching Using Streaming SIMD Extensions Technology [chapter]

Simone Faro, M. Oğuzhan Külekci
2012 Lecture Notes in Computer Science  
This study introduces a filter based exact multiple string matching algorithm, which benefits from Intel's SSE (streaming SIMD extensions) technology for searching long strings.  ...  Searching for all occurrences of a given set of patterns in a text is a fundamental problem in computer science with applications in many fields, like computational biology and intrusion detection systems  ...  , proposed algorithm is supposed to serve a good basis for massive multiple long pattern search applications on these areas.  ... 
doi:10.1007/978-3-642-34109-0_23 fatcat:6b254uyahjegbiqbbegnp4cqvy

On-Line Approximate String Searching Algorithms: Survey and Experimental Results

P. D. Michailidis, K. G. Margaritis
2002 International Journal of Computer Mathematics  
In this paper we present a short survey and experimental results for well known sequential approximate string searching algorithms.  ...  The problem of approximate string searching comprises two classes of problems: string searching with k mismatches and string searching with k differences.  ...  [BYP96] suggested a algorithm (in short, BYPEP) which combines the pattern partition approach with traditional multiple string searching algorithms.  ... 
doi:10.1080/00207160212111 fatcat:o247u5qptjhmrbyi3l67sc67wm

Page 476 of Computational Linguistics Vol. 30, Issue 4 [page]

2004 Computational Linguistics  
Stephen, Graham A. 1994. String Searching Algorithms. World Scientific, Singapore.  ...  A sublinear algorithm for approximate keyword searching. Algorithmica, 12(4/5):345-374. Navarro, Gonzalo. 2001. A guided tour to approximate string matching. ACM Computing Surveys, 33(1):31-88.  ... 

Memory efficient string matching algorithm for network intrusion management system

Jianming Yu, Yibo Xue, Jun Li
2007 Tsinghua Science and Technology  
This paper presents a memory and time efficient string matching algorithm specifically designed for NIMS on commodity processors.  ...  As the core algorithm and the most time consuming part of almost every modern network intrusion management system (NIMS), string matching is essential for the inspection of network flows at the line speed  ...  Acknowledgements The authors thank the anonymous reviewers for providing useful comments on this paper.  ... 
doi:10.1016/s1007-0214(07)70137-2 fatcat:c42x3gu6jzhjddclv7jtaisijy

Subject Index

2007 Journal of Discrete Algorithms  
polynomials and straight line programs, 471 Stressing A Zero-Space algorithm for Negative Cost Cycle Detection in net- works, 408 String A simple fast hybrid pattern-matching algorithm, 682; Two-pattern  ...  for extracting motifs from biological weighted se- quences, 229 Multilinear Exact arithmetic on the Stern-Brocot tree, 356 Multiple patterns Searching for a set of correlated patterns, 149 Natural  ... 
doi:10.1016/s1570-8667(07)00076-7 fatcat:wfqxglrznfb6do3wyittd5pfbi


Masayuki Takeda
1993 Bulletin of Informatics and Cybernetics  
The pattern matching problem is to find all occurrences of patterns in a text string.  ...  An extended problem is considered for patterns with pictures, where a picture is a don't-care that matches only the symbols in the set it represents.  ...  However, we want to search for multiple patterns very fast at a time. Hence we shall consider constructing a PMM for multiple patterns with pictures.  ... 
doi:10.5109/13427 fatcat:p6laeisgrfamtfarfeadrknmsy
« Previous Showing results 1 — 15 out of 42,647 results