Web scraping is a process of extracting valuable and interesting text information from web
pages. Most of the current studies targeting this task are mostly about automated web data …

Deep Packet Inspection plays an important role for providing secure and congestion free
network. It determines whether incoming traffic matches a database of signatures up to …

Cartesian tree matching is the problem of finding every substring of a given text which has
the same Cartesian tree as that of a given pattern. In this paper we propose fast algorithms …

To solve, manage and analyze biological problems using computer technology is called
bioinformatics. With the emergent evolution in computing era, the volume of biological data …

This paper addresses the online exact string matching problem which consists in finding all
occurrences of a given pattern p in a text t. It is an extensively studied problem in computer …

In this paper we consider several new versions of approximate string matching with gaps.
The main characteristic of these new versions is the existence of gaps in the matching of a …

Intuitiv ist uns klar, was eine Abbildung ist, was eine endliche Folge ist, was ein Graph ist
oder was eine Primzahl ist. Andere Begriffe, wie etwa injektiv, transitiv, Abschluss, Ring sind …

In this paper, we propose a string search algorithm that requires reduced time complexity. It
also requires a small amount of memory, and shows better performance than any other …

String matching is the problem of finding all the substrings of a text which correspond to a
given pattern. It's one of the most investigated problem in computer science, mainly due to its …

The swap matching problem consists in finding all occurrences of a pattern x of length m in a
text y of length n, allowing for disjoint local swaps of characters in the pattern. In 2003, Amir …