Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: Combinatorial RNA Design: Designability and Structure-Approximating
  Algorithm   In this work, we consider the Combinatorial RNA Design problem, a minimal
instance of the RNA design problem which aims at finding a sequence that admits
a given target as its unique base pair maximizing structure. We provide
complete characterizations for the structures that can be designed using
restricted alphabets. Under a classic four-letter alphabet, we provide a
complete characterization of designable structures without unpaired bases. When
unpaired bases are allowed, we provide partial characterizations for classes of
designable/undesignable structures, and show that the class of designable
structures is closed under the stutter operation. Membership of a given
structure to any of the classes can be tested in linear time and, for positive
instances, a solution can be found in linear time. Finally, we consider a
structure-approximating version of the problem that allows to extend bands
(helices) and, assuming that the input structure avoids two motifs, we provide
a linear-time algorithm that produces a designable structure with at most twice
more base pairs than the input structure.

37
The categories of this paper are: supr-con
5
The categories of this paper are: gr-qc
8
The categories of this paper are: hep-ex
18
The categories of this paper are: econ
15
The categories of this paper are: nucl-ex
11
The categories of this paper are: hep-lat
24
The categories of this paper are: dg-ga
32
The categories of this paper are: atom-ph
3
The categories of this paper are: physics
9
The categories of this paper are: nlin
13
The categories of this paper are: quant-ph
22
The categories of this paper are: chao-dyn
16
The categories of this paper are: stat
0
The categories of this paper are: hep-ph
27
The categories of this paper are: comp-gas
21
The categories of this paper are: adap-org