MODELS FOR BIOLOGICAL SYSTEMS
Course Objectives and Expected Outcomes:
The main target is to show that computer science and biology are related disciplines. On one side, the student will get familiarity with the main features of the languages and formalisms proposed to model and analyze biological systems and with pattern matching algorithms, which are two of the main examples of how computer science can be exploited in the biological setting. On the other side, the student will get familiarity on the main formalisms inspired by biological systems, e.g. systolic automata, Lindamayer systems and Membrane Systems, and on the basic ideas of DNA Computing.
The optimal evaluation procedure consists on a seminar given by the student.
A 3-years graduated student in Computer Science or Mathematics does not need any other prerequisite.
- DNA computing and application: SAT, TSP.
- Pattern matching, Boyer-Moore algorithm, Aho-Corasick algorithm, Apostolico-Giancarlo algorithm, Knuth-Morris-Pratt algorithm, with particular analysis on how they perform on DNA streams.
- Formal methods for biologic systems, Gillespie approach, Calculus of Looping Sequences.
- Cellular automata, Lindenmayer systems, Membrane systems.
- All slides will be on the website e-learning.
Cerchi il programma? Potrebbe non essere ancora stato caricato o riferirsi ad insegnamenti che verranno erogati in futuro.
Seleziona l‘anno in cui ti sei immatricolato e troverai le informazioni relative all'insegnamento del tuo piano di studio.