This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
E.B. Baum, DNA Sequences useful for computation, unpublished article, available at: http://www.neci.nj.nec.com/homepages/eric/seq.ps (1996).
J. Berstel, D. Perrin, Theory of Codes, Academic Press, Inc., Orlando, Florida, 1985.
R. Deaton, J. Chen, H. Bi, M. Garzon, H. Rubin, D.H. Wood, A PCR based protocol for n vitro selection of non-crosshybridizing oligonucleotides, DNA Computing: Proceedings of the 8th International Meeting on DNA Based Computers (M. Hagiya, A. Ohuchi editors), Springer LNCS 2568 (2003): 196–204.
R. Deaton, J. Chen, M. Garzon, J. Kim, D. Wood, H. Bi, D. Carpenter, Y. Wang, Characterization of non-crosshybridizing DNA oligonucleotides manufactured in vitro, DNA computing: Preliminary Proceedings of the 10th International Meeting on DNA Based Computers (C. Ferretti, G. Mauri, C. Zandron editors) Springer LNCS 3384, (2005): 50–61.
R. Deaton et al, A DNA based implementation of an evolutionary search for good encodings for DNA computation, Proc. IEEE Conference on Evolutionary Computation ICEC-97, (1997): 267–271.
D. Faulhammer, A.R. Cukras, R.J. Lipton, L.F. Landweber, Molecular Computation: RNA solutions to chess problems, Proceedings of the National Academy of Sciences, USA, 974 (2000): 1385–1389.
M. Garzon, R. Deaton, D. Renault, Virtual test tubes: a new methodology for computing, Proc. 7th. Int. Symposium on String Processing and Information retrieval, A Coruňa, Spain. IEEE Computing Society Press (2000): 116–121.
T. Head, Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors, Bull. Math. Biology 49 (1987): 737–759.
T. Head, Gh. Paun, D. Pixton, Language theory and molecular genetics, in Handbook of Formal Languages, Vol.II (G. Rozenberg, A. Salomaa editors) Springer-Verlag (1997): 295–358.
T. Head, Relativized code concepts and multi-tube DNA dictionaries, in Finite vs Infinite, C.S. Calude and Gh. Paun editors, Springer-Verlag (2000): 175–186.
S. Hussini, L. Kari, S. Konstantinidis, Coding properties of DNA languages, DNA Computing: Proceedings of the 7th International Meeting on DNA Based Computers (N. Jonoska, N.C. Seeman editors), Springer LNCS 2340 (2002): 57–69.
N. Jonoska, D. Kephart, K. Mahalingam, Generating DNA code words, Congressus Numerantium 156 (2002): 99–110.
N. Jonoska, K. Mahalingam, Languages of DNA based code words Proceedings of the 9th International Meeting on DNA Based Computers, J. Chen, J. Reif editors, Springer LNCS 2943 (2004): 61–73.
N. Jonoska, K. Mahalingam, J. Chen, Involution codes: with application to DNA coded languages, Natural Computing 42 (2005): 141–162.
H. Jürgensen, S.S. Yu, Solid codes, Journal of Information Processing and Cybernetics, EIK 26(10) (1990): 563–574.
H. Jürgensen, S. Konstantinidis, Codes, Handbook of Formal Languages, Vol 1, Chapter 8, G. Rozenberg and A. Salomaa editors, Springer-Verlag (1997).
H. Jürgensen, M. Katsura and S. Konstantinidis, Maximal solid codes, Journal of Automata, Languages and Combinatorics 6(1) (2001): 25–50.
L. Kari, K. Mahalingam, More on involution codes, Preprint.
L. Kari, S. Konstantinidis, E. Losseva, G. Wozniak, Sticky-free and overhangfree DNA languages, Acta Informatica 40 (2003): 119–157.
L. Kari, S. Konstantinidis, P. Sosik, Bond-free languages: formalizations, maximality and construction methods, in DNA Computng, Ferretti et al. (eds.), Springer LNCS 3384 (2004): 169–181.
L. Kari, S. Konstantinidis, P. Sosik, Preventing undesirable bonds between DNA codewords, in DNA Computng, Ferretti et al. (eds.), Springer LNCS 3384 (2004): 182–191.
D. Kephart, J. Lefevre, Codegen: The generation and testing of DNA code words, Proceedings of IEEE Congress on Evolutionary Computation, (2004): 1865–1873.
P. Leupold, Partial words for DNA coding, in DNA Computng, Ferretti et al. (eds.), Springer LNCS 3384 (2005): 224–234.
Z. Li, Construct DNA code words using backtrack algorithm, preprint.
K. Mahalingam, Involution Codes: With Application to DNA Strand Design Ph.d. Thesis, University of South Florida, Tampa, FL, 2004.
A. Marathe, A.E. Condon, R.M. Corn, On combinatorial DNA word design, DNA Based Computers V, E. Winfree, D.K. Gifford eds., Providence, RI, DIMACS, American Mathematical Society, (1999): 75–90.
H.J. Shyr, Free Monoids and Languages, Hon Min Book Company 2001.
H.J. Shyr, S.S. Yu, Solid codes and disjunctive domains, Semigroup Forum, 41 (1990): 23–37.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Kari, L., Mahalingam, K. (2006). Involution Solid Codes. In: Chen, J., Jonoska, N., Rozenberg, G. (eds) Nanotechnology: Science and Computation. Natural Computing Series. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-30296-4_8
Download citation
DOI: https://doi.org/10.1007/3-540-30296-4_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-30295-7
Online ISBN: 978-3-540-30296-4
eBook Packages: Computer ScienceComputer Science (R0)