Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Longest Common Subsequence in at Least $k$ Length Order-Isomorphic
  Substrings   We consider the longest common subsequence (LCS) problem with the restriction
that the common subsequence is required to consist of at least $k$ length
substrings. First, we show an $O(mn)$ time algorithm for the problem which
gives a better worst-case running time than existing algorithms, where $m$ and
$n$ are lengths of the input strings. Furthermore, we mainly consider the LCS
in at least $k$ length order-isomorphic substrings problem. We show that the
problem can also be solved in $O(mn)$ worst-case time by an easy-to-implement
algorithm.

0
The categories of this paper are: hep-ph
24
The categories of this paper are: dg-ga
3
The categories of this paper are: physics
20
The categories of this paper are: acc-phys
2
The categories of this paper are: math
14
The categories of this paper are: math-ph
36
The categories of this paper are: cmp-lg
32
The categories of this paper are: atom-ph
9
The categories of this paper are: nlin
34
The categories of this paper are: chem-ph
35
The categories of this paper are: mtrl-th
10
The categories of this paper are: q-bio
13
The categories of this paper are: quant-ph
17
The categories of this paper are: q-fin
21
The categories of this paper are: adap-org
12
The categories of this paper are: nucl-th