Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Sequence-Subset Distance and Coding for Error Control in DNA-based Data
  Storage   The process of DNA-based data storage (DNA storage for short) can be
mathematically modelled as a communication channel, termed DNA storage channel,
whose inputs and outputs are sets of unordered sequences. To design error
correcting codes for DNA storage channel, a new metric, termed the
sequence-subset distance, is introduced, which generalizes the Hamming distance
to a distance function defined between any two sets of unordered vectors and
helps to establish a uniform framework to design error correcting codes for DNA
storage channel. We further introduce a family of error correcting codes,
referred to as \emph{sequence-subset codes}, for DNA storage and show that the
error-correcting ability of such codes is completely determined by their
minimum distance. We derive some upper bounds on the size of the
sequence-subset codes including a tight bound for a special case, a
Singleton-like bound and a Plotkin-like bound. We also propose some
constructions, including an optimal construction for that special case, which
imply lower bounds on the size of such codes.

21
The categories of this paper are: adap-org
32
The categories of this paper are: atom-ph
20
The categories of this paper are: acc-phys
3
The categories of this paper are: physics
13
The categories of this paper are: quant-ph
26
The categories of this paper are: bayes-an
17
The categories of this paper are: q-fin
12
The categories of this paper are: nucl-th
31
The categories of this paper are: ao-sci
18
The categories of this paper are: econ
30
The categories of this paper are: q-alg
28
The categories of this paper are: alg-geom
36
The categories of this paper are: cmp-lg
4
The categories of this paper are: cond-mat
25
The categories of this paper are: patt-sol
19
The categories of this paper are: eess