2 research outputs found
Direct Linear Time Construction of Parameterized Suffix and LCP Arrays for Constant Alphabets
We present the first worst-case linear time algorithm that directly computes
the parameterized suffix and LCP arrays for constant sized alphabets. Previous
algorithms either required quadratic time or the parameterized suffix tree to
be built first. More formally, for a string over static alphabet and
parameterized alphabet , our algorithm runs in time and
words of space, where is the number of distinct symbols of in the
string.Comment: submitted to SPIRE 201
Exact Online String Matching Bibliography
In this short note we present a comprehensive bibliography for the online
exact string matching problem. The problem consists in finding all occurrences
of a given pattern in a text. It is an extensively studied problem in computer
science, mainly due to its direct applications to such diverse areas as text,
image and signal processing, speech analysis and recognition, data compression,
information retrieval, computational biology and chemistry. Since 1970 more
than 120 string matching algorithms have been proposed. In this note we present
a comprehensive list of (almost) all string matching algorithms. The list is
updated to May 2016.Comment: 23 page