Sticky-free and overhang-free DNA languages

Acta Informatica

Volumn 40, Issue 2, 2003, Pages 119-157

  Kari, Lila ^a   Konstantinidis, Stavros ^b   Losseva, Elena ^a   Wozniak, Geoff ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b SAINT MARY S UNIVERSITY   (Canada)

Author keywords

Codes; DNA encodings; Formal languages; Theoretical DNA computing

Indexed keywords

DATA ENCODING; DNA ENCODINGS; GENETIC INFORMATION; THEORETICAL DNA COMPUTING;

ALGORITHMS; COMPUTATION THEORY; DATA STRUCTURES; DNA; ENCODING (SYMBOLS); ERROR DETECTION;

FORMAL LANGUAGES;

EID: 4344586065     PISSN: 00015903     EISSN: 14320525     Source Type: Journal    
DOI: 10.1007/s00236-003-0118-7     Document Type: Article

References (28)

1. Adleman, L.: Molecular computation of solutions to combinatorial problems. Science 266, 1021-1024 (1994)
2. Baum, E. B.: DNA sequences useful for computation. In: Landweber, L. F., Baum, E. (eds.) Proceedings of DNA-based computers II. Princeton. AMS DIMACS Series 44 235-241 (1998)
3. Berstel, J., Perrin, D.: Theory of codes. Orlando: Academic Press 1985
4. Deaton, R., Garzon, M., Murphy, R., Franceschetti, D. R., Stevens, S. E.: Genetic search of reliable encodings for DNA based computation. In: Proceedings of First Conference on Genetic Programming, pp. 9-15. Stanford, Stanford University 1996
5. Deaton, R., Murphy, R., Garzon, M., Franceschetti, D. R., Stevens, S. E.: Good encodings for DNA-based solutions to combinatorial problems. In: Landweber, L. F., Baum, E. (eds.) Proceedings of DNA-Based Computers II, Princeton. AMS DIMACS Series 44 247-258 (1998)
6. Deaton, R., Murphy, R. E., Rose, J. A., Garzon, M., Franceschetti, D. R., Stevens, S. E., Jr.: A DNA based implementation of an evolutionary search for good encodings for DNA computation. In: Proceedings IEEE Conference on Evolutionary Computation, ICEC-97, 267-271 (1997)
7. Feldkamp, U., Saghafi, S., Rauhe, H.: DNASequenceGenerator - A program for the construction of DNA sequences. In: Jonoska, N., Seeman, N. C. (eds.), Proceedings of DNA-Based Computers VII, pp. 179-189. Tampa, Florida 2001
8. Frutos, A. G., Liu, Q., Thiel, A. J., Sanner, A. M. W., Condon, A. E., Smith, L. M., Corn, R. M.: Demonstration of a word design strategy for DNA computing on surfaces. Nucleic Acids Research 25 (23), 4748-4757 (1997)
9. Garzon, M., Deaton, R., Nino, L. F., Stevens, S. E., Jr., Wittner, M.: Genome encoding for DNA computing. In: Proceedings of 3rd Genetic Programming Conference, Madison, WI, pp. 684-690 (1998)
10. Garzon, M., Neathery, P., Deaton, R., Murphy, R. C., Franceschetti, D. R., Stevens, S. E., Jr.: A new metric for DNA computing. In: Koza, J. R., Deb, K., Dorigo, M., Vogel, D. B., Garzon, M., Iba, H., Riolo, R. L. (eds.) Proceedings of 2nd Annual Genetic Programming Conference, pp. 472-478. Stanford, Stanford University 1997
11. Garzon, M., Oehmen, C.: Biomolecular computation in virtual test tubes. In: Jonoska, N., Seeman, N. C. (eds.). Proceedings of DNA-Based Computers VII, pp. 75-83. Tampa, Florida 2001
12. Hartemink, A. J., Gifford, D. K., Khodor, J.: Automatic constraint-based nucleotide sequence selection for DNA computations. In: Kari, L., Rubin, H., Wood, D.H. (eds.) Proceedings of DNA-Based Computers IV, Philadelphia. Biosystems 52 (1-3), 227-235 (1999)
13. Head, T.: Formal language theory and DNA: an analysis of the generative capacity of specific recombinant behaviors. Bull. Math. Biol. 49, 737-759 (1987)
14. Hussini, S., Kari, L., Konstantinidis, S.: Coding properties of DNA languages. In: Jonoska, N., Seeman, N. C. (eds.) Proceedings of DNA-Based Computers VII. pp. 107-118. Tampa, Florida 2001
15. Jonoska, N., Seeman, N.C. (eds.): Proceedings of DNA-Based Computers VII, Tampa, Florida 2001
16. Jürgensen, H., Konstantinidis, S.: Codes. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, Vol. 1, pp. 511-600. Berlin, Springer 1997
17. Kari, L.: DNA computing: arrival of biological mathematics. The Mathematical Intelligencer 19 (2), 9-22 (1997)
18. Kari, L., Kitto, R., Thierrin, G.: Codes, involutions and DNA encoding. In: Brauer, W., Ehrig, H., Karhumaki, J., Salomaa, A. (eds.) Lecture Notes in Computer Science 2300, pp. 376-393. Berlin Heidelberg New York, Springer 2002
19. Kari, L., Thierrin, G.: Contextual insertions/deletions and computability. Information and Computation 131, 47-61 (1996)
20. Konstantinidis, S., O'Hearn, A.: Error-detecting properties of languages. Theoretical Computer Science 276, 355-375 (2003)
21. Manber, U.: Introduction to algorithms: A creative approach. Addison-Wesley Publishing Company 1989
22. Marathe, A., Condon, A., Corn, R.: On combinatorial DNA word design. In: Winfree, E., Gifford, D. (eds.) Proceeedings of DNA-Based Computers V, 75-89 (1999)
23. Paun, G., Rozenberg, G., Salomaa, A. (eds.) DNA Computing: New Computing Paradigms. Berlin, Heidelberg New York, Springer 1998
24. Reif, J. H., LaBean, T. H., Pirrung, M., Rana, V. S., Guo, B., Kingsford, C., Wickham, G. S.: Experimental construction of very large scale DNA databases with associative search capability. In: Jonoska, N., Seeman, N.C. (eds.): Proceedings of DNA-Based Computers VII, pp. 241-250. Tampa, Florida 2001
25. Rozenberg, G., Salomaa, A. (eds.) Handbook of formal languages. Berlin Heidelberg New York, Springer 1997
26. Shyr, H. J.: Free Monoids and Languages. Taichung, Taiwan: Hon Min Book Company 1991
27. Wood, D.: Theory of computation. New York: Harper and Row 1987
28. Yu, S.: Regular languages. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of formal languages. Vol. 1, pp. 41-110. Berlin Heidelberg New York, Springer 1997