String matching is the problem of finding all occurrences of a character pattern in a text. This paper provides an overview of different string matching algorithms and comparative study of these algorithms. In this paper, we have evaluated several algorithms, such as Naive string matching algorithm, Brute Force algorithm, Rabin-Karp algorithm, Boyer-Moore algorithm, KnuthMorris-Pratt algorithm,...

String data is especially important in the privacy preserving data mining domain because most DNA and biological data is coded as strings. In this paper, we will discuss a new method for privacy preserving mining of string data with the use of simple template based condensation models. The template based model turns out to be effective in practice, and preserves important statistical characteri...

We develop bit-parallel algorithms for exact string matching. Our algorithms are variations of the BNDM and Shift-Or algorithms. At each alignment the algorithms read a q-gram before testing the state variable. In addition we apply reading a 2-gram in one instruction. Our experiments show that many of the new variations are substantially faster than any previous string matching algorithm on x86...

The optimism about the possibilities of DNA computing is based on two central issues: the Watson-Crick complementarity and the massive parallelism of DNA strands. While the latter issue renders exhaustive searches possible and thus may settle problems previously considered intractable, the former issue is the cause behind the universality of many models of DNA computing. Moreover, complementari...

Many researchers have implemented string matching algorithms in various fields for instance finding the secret key RSA or other encryption methods as well as finding intruder's pattern in Intrusion Detection System, DNA matching, Carbon Chain matching. This paper aims to analyze and obtain an algorithm for discrete pattern matching. It also works for any type of string whether it be charac...

We propose a general approach for frequency based string mining, which has many applications, e.g. in contrast data mining. Our contribution is a novel algorithm based on a deferred data structure. Despite its simplicity, our approach is up to 4 times faster and uses about half the memory compared to the best-known algorithm of Fischer et al. Applications in various string domains, e.g. natural...

although hand injuries due to kite strings seem to be trivial, these injuries could be serious enough to lose the function of hand. this case series in the division of plastic and reconstructive surgery of our institution from august 2014 to january 2016 evaluated the clinic-etiological profile, severity and management of hand injuries due to kite strings assessed clinically and radiologically....

string from substituted selenobenzamides (2) a series of 2- arylselenazoles (3-7) were prepared. the antibacterial activity of compounds 3-7 against a number of microorganisms were determined. some of these compounds showed significant antibacterial activity