Involution codes: with application to DNA coded languages

  • Authors:

  • Nataša Jonoska;Kalpana Mahalingam;Junghuei Chen

  • Affiliations:

  • Department of Mathematics, University of South Florida, Tampa, USA 33620;Department of Mathematics, University of South Florida, Tampa, USA 33620;Department of Chemistry and Biochemistry, University of Delaware, Newark, USA 19716

  • Venue:
  • Natural Computing: an international journal
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

For an involution 驴 : 驴* 驴 驴* over a finite alphabet 驴 we consider involution codes: 驴-infix, 驴-comma-free, 驴-k -codes and 驴-subword-k-codes. These codes arise from questions on DNA strand design. We investigate conditions under which both X and X+ are same type of involution codes. General methods for generating such involution codes are given. The information capacity of these codes show to be optimized in most cases. A specific set of these codes was chosen for experimental testing and the results of these experiments are presented.