Problem statement: String matching algorithm had been an essential means for searching
biological sequence database. With the constant expansion in scientific data such as DNA …

Multiple pattern matching algorithms are used to locate the occurrences of patterns from a
finite pattern set in a large input string. Aho-Corasick, Set Horspool, Set Backward Oracle …

Exact String matching algorithms has been very significant in many applications in the last
two decades. This is due to the advancement in technology that produces large volumes of …

Due to the quick actions of technology, a complicated and huge volume of data deriving from
biological sciences are generated which makes string matching patterns a challenging task …

Multiple keyword matching is an important problem in text processing that involves the
location of all the positions of an input string where one or more keywords from a finite set …

The matching of search string patterns has become a bigger issue of concern because
biological sequence databases are growing rapidly at overwhelming proportions so string …

With the remarkable increase in the number of DNA and proteins sequences, it is very
important to study the performance of multiple pattern matching algorithms when querying …

The matching of search string patterns has become a bigger issue of concern because
biological sequence databases are growing rapidly at overwhelming proportions so string …

This paper presents a survey of multiple pattern matching algorithms and experimental
results of the well-known Aho-Corasick, Set Horspool, Set Backward Oracle Matching, Wu …

Exact string-matching algorithms have become very supreme in many bioinformatics tools.
Despite the abundance and diversity of such algorithms, exposing them to real-time …