Binary templates for comma-free DNA codes

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 a satisfies d <= n/2. Kobayashi, Kondo and Arita later produced an infinite family of binary templates with d >= 11 n/30. Here we demonstrate the existence of an infinite family of binary templates with d > n/2 - (18n log(e) n) (1/2). We also give an explicit construction for an infinite family of binary templates with d > n/2 - 19n (1/2) log(e) n. (c) 2006 Elsevier B.V. All rights reserved.