Background Sequence comparison is a fundamental step in many important tasks in
bioinformatics; from phylogenetic reconstruction to the reconstruction of genomes …

Recently, there has been a growing focus in solving approximate pattern matching problems
in the streaming model. Of particular interest are the pattern matching with k-mismatches …

In the streaming multi-pattern search problem, which is also known as the streaming
dictionary matching problem, a set D={P_1, P_2,..., P_d} of d patterns (strings over an …

Sequence comparison is the core computation of many applications involving textual
representations of data. Edit distance is the most widely used measure to quantify the …

We introduce the Longest Common Circular Factor (LCCF) problem in which, given strings $
S $ and $ T $ of length $ n $, we are to compute the longest factor of $ S $ whose cyclic shift …

A fingerprint recognition method based on Gabor wavelet transform and discrete cosine
transform (DCT) was proposed. The multichannel Gabor filters and improved binarization …

Abstract In the Range Minimum Query (RMQ) problem, we are given an array A of n
numbers and we are asked to answer queries of the following type: for indices i and j …

Circular DNA sequences can be found in viruses, as plasmids in archaea and bacteria, and
in the mitochondria and plastids of eukaryotic cells. Hence, circular sequence comparison …

Dictionary Matching is a variant of the Pattern Matching problem where multiple patterns are
simultaneously matched to a single text. In case where the patterns contain sequences of …

In the classic dictionary matching problem, the input is a dictionary of patterns D={P_1, P_2,
..., P_k\} D= P 1, P 2,…, P k and a text T, and the goal is to report all the occurrences in T of …