The main drive of my research are the following general questions: How does biology compute? If we assume that within a given bio/chemical process molecules solve a computational problem, what is the problem that is being solved? How does its solution produce the resulting molecules? More specifically, my research is in formal models describing molecular computation often based on cellular or other finite types of automata, formal language theory symbolic dynamics, and topological graph theory.
- Homologous DNA recombination
- Mathematical models for crystalline or recursive growth of structures at molecular levels.
My research group: Discrete and Topological Models for DNA Assembly
- Theoretical Computer Science
- International Journal of Foundations of Computer Science
- Natural Computing
- N. Jonoska, M. Saito, Discrete and Topological Models in Molecular Biology in preparation, Springer (to appear 2013)
- J. Durland-Lose, N. Jonoska, Unconventional Computation and Natural Computation 11th International Conference, UCNC 2012 Orlans, France, September 3-7, 2012, LNCS 7445 Springer, 2012.
- J. Chen, N. Jonoska, Nanotechnology: Science and Computing Springer - Verlag 2006.
- N. Jonoska, Gh. Paun, G. Rozenberg Aspects of Molecular Computing LNCS 2950 Springer-Verlag 2004
- N. Jonoska, N.C. Seeman DNA Computing, Revised papers from the 7th International Meeting on DNA Based Computers LNCS 2340 Springer-Verlag 2002
Chair of Steering Committee:
- DNA Computing and Molecular Programming
- Unconventional Computation and Natural Computation (Co-chair with Jarkko Kari)
Member of Steering Committee:
- Discrete and Topological Models for DNA Assembly
- AMS 2012 Spring Southeastern Section Meeting
- Computability in Europe
- Developments in Language Theory
- Describing self-assembly of Nanostructures, seminar, York Centre for Complex Systems (YCCSA), University of York, UK, June 15, 2012.
- Homologous DNA recombination through spatial graphs biomathematics seminar, Imperial College, London, UK June 12, 2012.
- Automata Generated 2D Languages Implemented by DNA Self-assembly, (colloquium) University of Tampa, Sept. 27, 2011.
- Splicing languages must have a constant, Developments in Language Theory 2011, Milano, Italy, July 18-22, 2011.
- Constants in splicing languages, Workshop in Language Theory at the Unconventional Computing Meeting 2011, Turku, Finland June 6-10, 2011.
- DNA rearrangements through spacial graphs, AMS Meeting, Iowa City, March 15-20, 2011.