Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Longest common subsequences and the Bernoulli matching model: numerical
  work and analyses of the r-reach simplification   The expected length of longest common subsequences is a problem that has been
in the literature for at least twenty five years. Determining the limiting
constants \gamma_k appears to be quite difficult, and the current best bounds
leave much room for improvement. Boutet de Monvel explores an independent
version of the problem he calls the Bernoulli Matching model. He explores this
problem and its relation to the longest common subsequence problem. This paper
continues this pursuit by focusing on a simplification we term r-reach. For the
string model, L_r(u,v) is the longest common subsequence of u and v given that
each matched pair of letters is no more than r letters apart.

4
The categories of this paper are: cond-mat
12
The categories of this paper are: nucl-th
35
The categories of this paper are: mtrl-th
28
The categories of this paper are: alg-geom
5
The categories of this paper are: gr-qc
24
The categories of this paper are: dg-ga
9
The categories of this paper are: nlin
29
The categories of this paper are: funct-an
34
The categories of this paper are: chem-ph
17
The categories of this paper are: q-fin
33
The categories of this paper are: plasm-ph
25
The categories of this paper are: patt-sol
8
The categories of this paper are: hep-ex
0
The categories of this paper are: hep-ph
13
The categories of this paper are: quant-ph
7
The categories of this paper are: hep-th