53,952 research outputs found
A New Multi-threaded and Interleaving Approach to Enhance String Matching for Intrusion Detection Systems
String matching algorithms are computationally intensive operations in computer science. The algorithms find the occurrences of one or more strings patterns in a larger string or text. String matching algorithms are important for network security, biomedical applications, Web search, and social networks. Nowadays, the high network speeds and large storage capacity put a high requirement on string matching methods to perform the task in a short time. Traditionally, Aho-Corasick algorithm, which is used to find the string matches, is executed sequentially. In this paper, a new multi-threaded and interleaving approach of Aho-Corasick using graphics processing units (GPUs) is designed and implemented to achieve high-speed string matching. Compute Unified Device Architecture (CUDA) programming language is used to implement the proposed parallel version. Experimental results show that our approach achieves more than 5X speedup over the sequential and other parallel implementations. Hence, a wide range of applications can benefit from our solution to perform string matching faster than ever before
A Frame Work for Parallel String Matching- A Computational Approach with Omega Model
Now a day2019;s parallel string matching problem is attracted by so many researchers because of the importance in information retrieval systems. While it is very easily stated and many of the simple algorithms perform very well in practice, numerous works have been published on the subject and research is still very active. In this paper we propose a omega parallel computing model for parallel string matching. Experimental results show that, on a multi-processor system, the omega model implementation of the proposed parallel string matching algorithm can reduce string matching time by more than 40%
Highly Scalable Algorithms for Robust String Barcoding
String barcoding is a recently introduced technique for genomic-based
identification of microorganisms. In this paper we describe the engineering of
highly scalable algorithms for robust string barcoding. Our methods enable
distinguisher selection based on whole genomic sequences of hundreds of
microorganisms of up to bacterial size on a well-equipped workstation, and can
be easily parallelized to further extend the applicability range to thousands
of bacterial size genomes. Experimental results on both randomly generated and
NCBI genomic data show that whole-genome based selection results in a number of
distinguishers nearly matching the information theoretic lower bounds for the
problem
Efficient Pattern Matching on Binary Strings
The binary string matching problem consists in finding all the occurrences of
a pattern in a text where both strings are built on a binary alphabet. This is
an interesting problem in computer science, since binary data are omnipresent
in telecom and computer network applications. Moreover the problem finds
applications also in the field of image processing and in pattern matching on
compressed texts. Recently it has been shown that adaptations of classical
exact string matching algorithms are not very efficient on binary data. In this
paper we present two efficient algorithms for the problem adapted to completely
avoid any reference to bits allowing to process pattern and text byte by byte.
Experimental results show that the new algorithms outperform existing solutions
in most cases.Comment: 12 page
A Parallel Computational Approach for String Matching- A Novel Structure with Omega Model
In r e cent day2019;s parallel string matching problem catch the attention of so many researchers because of the importance in different applications like IRS, Genome sequence, data cleaning etc.,. While it is very easily stated and many of the simple algorithms perform very well in practice, numerous works have been published on the subject and research is still very active. In this paper we propose a omega parallel computing model for parallel string matching. The algorithm is designed to work on omega model pa rallel architecture where text is divided for parallel processing and special searching at division point is required for consistent and complete searching. This algorithm reduces the number of comparisons and parallelization improves the time efficiency. Experimental results show that, on a multi - processor system, the omega model implementation of the proposed parallel string matching algorithm can reduce string matching time
GPU-based odd and even hybrid string matching algorithm
String matching is considered as one of the
fundamental problems in computer science.Many
computer applications provide the string matching
utility for their users, and how fast one or more
occurrences of a given pattern can be found in a text plays a prominent role in their user satisfaction.Although numerous algorithms and methods are available to solve the string matching problem, the remarkable increase in the amount of data which is produced and stored by modern computational devices demands researchers to find much more efficient ways for dealing with this issue.In this research, the Odd and Even (OE) hybrid string matching algorithm is redesigned to be executed on the Graphics Processing Unit (GPU), which can be utilized to reduce the burden of compute-intensive operations from the Central Processing Unit (CPU).In fact, capabilities of the GPU as a massively parallel processor are employed to enhance the performance of the existing hybrid string matching algorithms.Different types of data are used to evaluate the impact of parallelization and implementation of both algorithms on the GPU. Experimental results indicate that the performance of the hybrid string matching algorithms has been improved, and the speedup, which has been obtained, is considerable enough to suggest the GPU as the suitable platform for these hybrid string-matching algorithms
Advanced Searching Algorithms and its Behavior on Text Structures
This research investigates the behavior of the Boyer-Moore-Horspool (BMH) and the Boyer-Moore-Raita (BMR) string-matching algorithms using multilingual texts. The performance is computed based on searching for patterns in master strings. Experiments are conducted using a number of pattern lengths with many experiments repetition. The experimental results show that on average the number of comparisons per character passed in the case of the BMR is less than the number encountered by the BMH variant. The improvement is due to properties of the text structures. These experiments may lead to more theoretical and practical studies to develop new variants of algorithms. Using multilingual text structures provide more insight into the theory and structure of algorithms as multilingual text structures have different set of characters and dependencies, and the character properties have different type of structures. Since many applications of today depend on searching algorithms, therefore researchers need to explore every possibility that lead to improving the efficiency of searching and matching mechanisms. The time performance of exact string pattern matching can be greatly improved if an efficient algorithm is used. Considering, for example, the growing amount of text handled in the electronic patient records, it is worth and essential, in these cases and others, to searching for an efficient algorithm to deal with such huge items of information. Keywords: Matching, Boyer-Moore, Raita algorithm, Searching, multilingua
- …