Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: 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 $\Sigma$ and
parameterized alphabet $\Pi$, our algorithm runs in $O(n\pi)$ time and $O(n)$
words of space, where $\pi$ is the number of distinct symbols of $\Pi$ in the
string.

14
The categories of this paper are: math-ph
3
The categories of this paper are: physics
33
The categories of this paper are: plasm-ph
18
The categories of this paper are: econ
7
The categories of this paper are: hep-th
2
The categories of this paper are: math
34
The categories of this paper are: chem-ph
19
The categories of this paper are: eess
21
The categories of this paper are: adap-org
27
The categories of this paper are: comp-gas
28
The categories of this paper are: alg-geom
5
The categories of this paper are: gr-qc
32
The categories of this paper are: atom-ph
37
The categories of this paper are: supr-con
20
The categories of this paper are: acc-phys
0
The categories of this paper are: hep-ph