On properties of bond-free DNA languages

Theoretical Computer Science

Volumn 334, Issue 1-3, 2005, Pages 131-159

  Kari, Lila ^a   Konstantinidis, Stavros ^b   Sosík, Petr ^a,c  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

^b SAINT MARY S UNIVERSITY   (Canada)

^c SILESIAN UNIVERSITY IN OPAVA   (Czech Republic)

Author keywords

Binary word operation; DNA computing; DNA language

Indexed keywords

ALGORITHMS; BINDING ENERGY; ENCODING (SYMBOLS); FORMAL LANGUAGES; POLYNOMIALS; PROBLEM SOLVING;

BINARY WORD OPERATIONS; DNA COMPUTING; DNA LANGUAGES; MOLECULAR COMPUTING;

DNA;

EID: 16344377086     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.12.032     Document Type: Article

References (24)

1. M. Arita, and S. Kobayashi DNA sequence design using templates New Gener. Comput. 20 2002 263 277
2. C.S. Calude, and G. P̧un Computing with Cells and Atoms 2001 Taylor & Francis London
3. M. Crochemore, C. Hancart, Automata for matching patterns, in: [21], Vol. II, pp. 399-462.
4. M. Domaratzki, Deletion Along Trajectories, Technical Report 2003-464, School of Computing, Queen's University, 2003; Theoret. Comput. Sci. 320 (2004) 293-313.
5. M. Domaratzki, Deletion Along Trajectories, Technical Report 2003-464, School of Computing, Queen's University, 2003; Theoret. Comput. Sci. 320 (2004) 293-313.
6. T. Head Relativised code concepts and multi-tube DNA dictionaries C.S. Calude G. P̂un Finite Versus Infinite Contributions to an Eternal Dilemma 2000 Springer London 175 186
7. J.E. Hopcroft, R. Motwani, and J.D. Ullman Introduction to Automata Theory, Languages, and Computation 2001 Addison-Wesley Boston
8. S. Hussini, L. Kari, and S. Konstantinidis Coding properties of DNA languages Theoret. Comput. Sci. 290/3 2002 1557 1579
9. N. Jonoska, D. Kephart, and K. Mahalingam Generating DNA code words Congr. Numer. 156 2002 99 110
10. N. Jonoska, K. Mahalingam, Languages of DNA based code words, in: J. Chen, J. Reif (Eds.), Preproceedings of DNA9, 1-4 June 2003, Madison, Wisconsin, pp. 58-68.
11. L. Kari, On insertion and deletion in formal languages, Ph.D. Thesis, University of Turku, Finland, 1991.
12. L. Kari On language equations with invertible operations Theoret. Comput. Sci. 132 1994 129 150
13. L. Kari, R. Kitto, G. Thierrin, Codes, involutions and DNA encoding, in: W. Brauer, H. Ehrig, J. Karhumäki, A. Salomaa (Eds.), Lecture Notes in Computer Science, Vol. 2300, 2002, pp. 376-393.
14. L. Kari, S. Konstantinidis, Language equations, maximality and error detection, J. Comput. System Sci., to appear.
15. L. Kari, S. Konstantinidis, E. Losseva, and G. Wozniak Sticky-free and overhang-free DNA languages Acta Inform. 40 2003 119 157
16. L. Kari, P. Sosík, Language Deletion on Trajectories, Department of Computer Science Technical Report No. 606, University of Western Ontario, London, 2003.
17. L. Kari, P. Sosík, Aspects of shuffle and deletion on trajectories, Theoret. Comput. Sci., to appear, doi:10.1016/j.tcs.2004.09.038.
18. A. Marathe, A.E. Condon, and R.M. Corn On combinatorial DNA words design J. Comput. Biol. 8 3 2001 201 220
19. G. Mauri, C. Ferretti, Word design for molecular computing: a survey, in: J. Chen, J.H. Reif (Eds.), DNA Computing, Ninth International Workshop on DNA Based Computers, Lecture Notes in Computer Science, Vol. 2943, 2004, pp. 37-46.
20. A. Mateescu, G. Rozenberg, and A. Salomaa Shuffle on Trajectories Syntactic Constraints, TUCS Technical Report No. 41, Turku Centre for Computer Science, 1996 Theoret. Comput. Sci. 197 1998 1 56
21. G. P̂un, G. Rozenberg, and A. Salomaa DNA Computing, New Computing Paradigms 1998 Springer Berlin
22. G. Rozenberg, A. Salomaa (Eds.), Handbook of Formal Languages, Springer, Berlin, 1997.
23. A. Salomaa Formal Languages 1973 Academic Press London
24. S. Yu, Regular languages, in: [21], Vol. I, pp. 41-110.