LNCS 2950 - Aspects of Molecular Computing (Frontmatter Pages)

252 Nataˇsa Jonoska and Kalpana Mahalingam
2. M. Arita and S. Kobayashi, DNA sequence design using templates, New Generation
Comput. 20(3), 263–277 (2002). (Available as a sample paper at
http://www.ohmsha.co.jp/ngc/index.htm.)
3. E.B. Baum, DNA Sequences useful for computation unpublished article, available
at: http://www.neci.nj.nec.com/homepages/eric/seq.ps (1996).
4. R.S. Braich, N. Chelyapov, C. Johnson, P.W.K. Rothemund, L. Adleman, Solution
of a 20-variable 3-SAT problem on a DNA computer, Science 296 (2002) 499-502.
5. J. Berstel, D. Perrin, Theory of codes, Academis Press, Inc. Orlando Florida, 1985.
6. D. Lind, B. Marcus, An introduction to Symbolic Dynamics and Coding, Cambridge
University Press, Inc. Cambridge United Kingdom, 1999.
7. R. Deaton, J. Chen, H. Bi, M. Garzon, H. Rubin, D.F. Wood, A PCR-based protocol
for in 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.
8. 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.
9. 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 97 4 (2000) 1385-1389.
10. U. Feldkamp, S. Saghafi, H. Rauhe, DNASequenceGenerator - A program for the
construction of DNA sequences, DNA Computing: Proceedings of the 7th International
Meeting on DNA Based Computers (N. Jonoska, N.C. Seeman editors),
Springer LNCS 2340 (2002) 23-32.
11. M. Garzon, R. Deaton, D. Reanult, Virtual test tubes: a new methodology for computing,
Proc. 7th. Int. Symposium on String Processing and Information retrieval,
ACoru˘na, Spain. IEEE Computing Society Press (2000) 116-121.
12. T. Head, Relativised code properties and multi-tube DNA dictionaries in Finite vs.
Infinite (Ed. by C. Calude, Gh. Paun) Springer, (2000) 175-186.
13. 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.
14. N. Jonoska, K. Mahalingam Languages of DNA based code words Preliminary Proceedings
of the 9th International Meeting on DNA Based Computers, Madison,
Wisconsin June 1-4, (2003) 58-68.
15. N. Jonoska, D. Kephart, K. Mahalingam, Generating DNA code words Congressus
Numernatium 156 (2002) 99-110.
16. L. Kari, S. Konstantinidis, E. Losseva, G. Wozniak, Sticky-free and overhang-free
DNA languages preprint.
17. M.S. Keane, Ergodic theory an subshifts of finite type, inErgodic theory, symbolic
dynamics and hyperbolic spaces (ed. T. edford, et.al.) Oxford Univ. Press, Oxford
1991, pp.35-70.
18. Z. Li, Construct DNA code words using backtrack algorithm, preprint.
19. Q. Liu et al., DNA computing on surfaces, Nature403 (2000) 175-179.
20. A. Marathe, A.E. Condon, R.M. Corn, On combinatorial word design, Preliminary
Preproceedings of the 5th International Meeting on DNA Based Computers, Boston
(1999) 75-88.
21. Gh. Paun, G. Rozenberg, A. Salomaa, DNA Computing, new computing paradigms,
Springer Verlag 1998.