Binary templates for comma-free DNA codes

Authors:
Oliver D. King;Philippe Gaborit
Affiliations:
Department of Biological Chemistry and Molecular Pharmacology, Harvard Medical School, Boston, USA;LACO, Université de Limoges, 123 av. A. Thomas, 87060 Limoges, France
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 4
Cited 1

Number theory in science and communication

Number theory in science and communication
Molecular computation of solutions to combinatorial problems

Science
DNA sequence design using templates

New Generation Computing
On Template Method for DNA Sequence Design

DNA8 Revised Papers from the 8th International Workshop on DNA Based Computers: DNA Computing

A novel color image encryption algorithm based on DNA sequence operation and hyper-chaotic system

Journal of Systems and Software

Quantified Score

Hi-index	0.04

Visualization

Abstract

Arita and Kobayashi proposed a method for constructing comma-free DNA codes using binary templates, and showed that the separation d of any such binary template of length n satisfies d==11n/30. Here we demonstrate the existence of an infinite family of binary templates with dn/2-(18nlog"en)^1^/^2. We also give an explicit construction for an infinite family of binary templates with dn/2-19n^1^/^2log"en.