Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: A Fixed-Parameter Algorithm for Minimum Common String Partition with Few
  Duplications   Motivated by the study of genome rearrangements, the NP-hard Minimum Common
String Partition problems asks, given two strings, to split both strings into
an identical set of blocks. We consider an extension of this problem to
unbalanced strings, so that some elements may not be covered by any block. We
present an efficient fixed-parameter algorithm for the parameters number k of
blocks and maximum occurrence d of a letter in either string. We then evaluate
this algorithm on bacteria genomes and synthetic data.

25
The categories of this paper are: patt-sol
36
The categories of this paper are: cmp-lg
15
The categories of this paper are: nucl-ex
29
The categories of this paper are: funct-an
14
The categories of this paper are: math-ph
7
The categories of this paper are: hep-th
28
The categories of this paper are: alg-geom
23
The categories of this paper are: solv-int
22
The categories of this paper are: chao-dyn
8
The categories of this paper are: hep-ex
4
The categories of this paper are: cond-mat
30
The categories of this paper are: q-alg
3
The categories of this paper are: physics
27
The categories of this paper are: comp-gas
37
The categories of this paper are: supr-con
35
The categories of this paper are: mtrl-th