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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
RL Adler D Coppersmith M Hassner (1983) ArticleTitleAlgorithms for sliding block codes – An application of symbolic dynamics to information theory IEEE Trans Inform Theory 29 5–22 Occurrence Handle10.1109/TIT.1983.1056597
M Arita S Kobayashi (2002) ArticleTitleDNA sequence design using templates New Generation Comput 20 IssueID3 263–277
J Berstel D Perrin (1985) Theory of Codes Academis Press Inc. Orlando, Florida
RS Braich N Chelyapov C Johnson PWK Rothemund L Adleman (2002) ArticleTitleSolution of a 20-variable 3-SAT problem on a DNA computer Science 296 499–502 Occurrence Handle10.1126/science.1069528 Occurrence Handle11896237
Deaton R, Chen J, Bi H, Garzon M, Rubin H and Wood DF (2003). A PCR-based protocol for in vitro selection of non-crosshybridizing oligonucleotides. DNA Computing: Proceedings of the 8th International Meeting on DNA Based Computers. In: Hagiya M, and Ohuchi A. (eds), Springer LNCS 2568: 196–204
Deaton R. et al. (1997). A DNA based implementation of an evolutionary search for good encodings for DNA computation. Proceedings of IEEE Conference on Evolutionary Computation ICEC-97, pp. 267–271
D Faulhammer AR Cukras RJ Lipton LF Landweber (2000) ArticleTitleMolecular Computation: RNA solutions to chess problems Proceedings of the National Academy of Sciences, USA 97 IssueID4 1385–1389
Feldkamp U, Saghafi S and Rauhe H (2002). DNA sequence generator – A program for the construction of DNA sequences, In: Jonoska N and Seeman NC (eds). DNA Computing: Proceedings of the 7th International Meeting on DNA Based Computers, Springer LNCS 2340: 23–32
Garzon M, Deaton R and Reanult D (2000). Virtual test tubes: a new methodology for computing, Proceedings of 7th International Symposium on String Processing and Information Retrieval, A Coruna, IEEE Computing Society Press, Spain 116–121.
T Head (1987) ArticleTitleFormal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors Bull. Math. Biology 49 737–759
Head T, Paun Gh., Pixton D (1997). Language theory and molecular genetics, Handbook of Formal Languages, Vol. II, In: Rozenberg G, and Salomaa A. (eds). Springer Verlag pp. 295–358
S Hussini L Kari S Konstantinidis (2003) ArticleTitleCoding properties of DNA languages Theoretical Computer Science 290 1557–1579 Occurrence Handle10.1016/S0304-3975(02)00069-5
N Jonoska D Kephart K Mahalingam (2002) ArticleTitleGenerating DNA code words Congressus Numernatium 156 99–110
Jonoska N and Mahalingam K (2004). Languages od DNA based code words , Proceedings of the 9th International Meeting on DNA Based Computers, In: Chen J, and Reif J. (eds), Springer LNCS 2943: 61–73
Jonoska N and Mahalingam K (2004). Methods for constructing coded DNA languages, In: Jonoska N, Paun G and Rozenberg G (eds), Aspects of Molecular Computing, Springer LNCS 2950: 241–253
L Kari S Konstantinidis E Losseva G Wozniak (2003) ArticleTitleSticky-free and overhang-free DNA languages Acta Informatica 40 119–157 Occurrence Handle10.1007/s00236-003-0118-7
MS. Keane et al. (1991) Ergodic theory an subshifts of finite type T. Edford (Eds) Ergodic Theory, Symbolic Dynamics and Hyperbolic Spaces Oxford University Press Oxford 35–70
Li Z (2002). Construct DNA code words using backtrack algorithm, preprint
D Lind B Marcus (1999) An Introduction to Symbolic Dynamics and Coding Cambridge University Press Inc. Cambridge, United Kingdom
Q Liu et al. (2000) ArticleTitleDNA computing on surfaces Nature 403 175–179 Occurrence Handle10.1038/35001232 Occurrence Handle10646598
Marathe A, Condon AE and Corn RM (1999). On combinatorial word design. Preliminary Preproceedings of the 5th International Meeting on DNA Based Computers, pp. 75–88 Boston.
Paun Gh, Rosenberg G and Salomaa A (1998). DNA Computing. New Computing Paradigms, Springer Verlag
Ruben AJ, Freeland SJ and Landweber LF (2002). PUNCH: An evolutionary algorithm for optimizing bit set selection. In: Jonoska N, Seeman NC (eds). DNA Computing: Proceedings of the 7th International Meeting on DNA Based Computers, Springer LNCS 2340: 150–160
NC Seeman (1990) ArticleTitleDe Novo design of sequences for nucleic acid structural engineering Journal of Biomolecular Structure & Dynamics 8 IssueID3 573–581
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Jonoska, N., Mahalingam, K. & Chen, J. Involution codes: with application to DNA coded languages. Nat Comput 4, 141–162 (2005). https://doi.org/10.1007/s11047-004-4009-9
Issue Date:
DOI: https://doi.org/10.1007/s11047-004-4009-9