|
|||||
|
|
Involution codes: with application to DNA coded languages |
|
| Authors: | |
| Affiliation: | (1) Department of Mathematics, University of South Florida, Tampa, FL 33620, USA;(2) Department of Chemistry and Biochemistry, University of Delaware, Newark, DE 19716, USA |
| 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. |
| Keywords: | codes DNA codes Watson– Crick involution |
| 本文献已被 SpringerLink 等数据库收录！ | |