Author:
Konstantinidis Stavros,Santean Nicolae
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications
Reference21 articles.
1. Adleman LM (1994) Molecular computation of solutions to combinatorial problems. Science 226:1021–1024
2. Arita M, Kobayashi S (2002) DNA sequence design using templates. New Gener Comput 20:263–277
3. Campeanu C, Konstantinidis S (2008) State complexity of the subword closure operation with applications to DNA coding. Int J Found Comput Sci 19(5):1099–1112
4. Chen J, Reif J (eds) (2004) 9th International workshop on DNA based computers, DNA9, Madison, USA, 1–3 June 2003, revised papers. Lecture notes in computer science, vol 2943. Springer, Berlin
5. Crochemore M, Hancart C (1997) Automata for matching patterns. In: Rozenberg G, Salomaa A (eds) Handbook of formal languages, vol 1. Springer, Berlin, pp 399–462