Primer design for DNA storage random access
Jeremy Mateos  1, 2@  , Dominique Lavenier  3@  , Marc Antonini  4@  , Melpomeni Dimopoulou, Anthony Genot  5@  
1 : i3s
Université Côte d'Azur (UCA), CNRS : UMR7271
2 : PEARCODE
Aucune
3 : Scalable, Optimized and Parallel Algorithms for Genomics
Inria Rennes – Bretagne Atlantique, GESTION DES DONNÉES ET DE LA CONNAISSANCE, Inria Rennes – Bretagne Atlantique
4 : i3s
Université Côte d'Azur (UCA), CNRS : UMR7271
Univ. Nice-Sophia Antipolis, CNRS, Laboratory I3S, UMR 7271, 06100 Sophia Antipolis -  France
5 : Laboratory for Integrated Micro Mechatronics Systems  (LIMMS)
LIMMS/CNRS-IIS(UMI 2820)/ Institute of Industrial Science, University of Tokyo/ 4-6-1 Komaba, Meguro-ku, Tokyo 153-8505 Japan/ -  Japon

DNA is a promising candidate for data storage due to its
high density and long-term stability. However, accessing
specific data, known as random access, is challenging.
This process uses primers, short DNA segments that act
as identifiers. Efficient random access depends on high-
quality primers, constrained by DNA structure. This paper
introduces a method to generate primers that meet strict
biochemical criteria, avoiding sequences that form prob-
lematic shapes. The tool uses computational models to pre-
dict primer binding affinity and specificity, allowing users
to adjust parameters for lab protocols, enhancing data re-
trieval efficiency and optimization.


Personnes connectées : 3 Vie privée
Chargement...