(Cerca di diventare non una persona di successo, ma di valore. Anonimo) |
Theory of Codes
It was my first love! During my Laurea Degree I studied Shutzenberger Factorization Conjecture about noncommutative factorization of variable length codes. I have also studied known algorithms for deciding whether a regular (finite) language is a code, providing some corrections to one of them (see the list of my publications).
I have prepared here some links that
you can use to know this area.
DNA-Computing
During my PhD, I have met Molecular Computing. Molecular computing is a new paradigm in computational mathematics. Its motivation comes from the interlink between mathematics, biology and computer science. While not the first article, Len Adleman's 1994 paper is often regarded as the seminal paper in the field. Since then the field has developed rapidly across the globe. There is one international conference on DNA Computing and there are also a number of smaller conferences in which unconventional methods of computation such as molecular computing play a central part. I'm interested in studing the comparison between splicing systems and regular languages, and some coding problems for DNA algorithms. You can find here a collection of links.
I am curator of the page regarding "Splicing Systems" for Scholarpedia
(the link is here).
My co-authors:
Paola Bonizzoni
Clelia De Felice
Giancarlo Mauri
Claudio Ferretti
Sergey Verlan
Gabriele Fici
Michelangelo Cianciulli
Rocco Zaccagnino