DNA Codes that Avoid Secondary Structures
Olgica Milenkovic, Navin Kashyap
Abstract
In this paper, we consider the problem of designing DNA sequences (codewords) for DNA storage systems and DNA computing that are unlikely to fold back onto themselves to form undesirable secondary structures. The paper addresses both the issue of enumerating the sequences with such properties and the problem of practical code construction.
Create a lesson
Related papers
Boxicity of Power Graphs of Finite Nilpotent Groups
L. Sunil Chandran, Jinia Ghosh, Suraj Kumar Sahoo
Monadically Dependent Graph Classes Have Almost Bounded Merge-Width
Jan Dreier, Nikolas Mählmann, Michał Pilipczuk et al.
A Polynomial Erdős-Pósa bound for Eulerian digraphs
Esther Galby, Roohani Sharma, Bart van der Steenhoven
How Unbalanced Must a Latin Rectangle Be?
Zhengyu Li, Vijay Ganesh
Classifying K-Geodetic Graphs Via Combinatorial Designs and Distance-regularity
Carlos E. Frasser
Graph Similarity Meets Optimal Transport
Jens Breitung, Timo Gervens, Martin Grohe