Studying at the University of Verona
Here you can find information on the organisational aspects of the Programme, lecture timetables, learning activities and useful contact details for your time at the University, from enrolment to graduation.
Study Plan
The Study Plan includes all modules, teaching and learning activities that each student will need to undertake during their time at the University.
Please select your Study Plan based on your enrollment year.
1° Year
Modules | Credits | TAF | SSD |
---|
2° Year activated in the A.Y. 2010/2011
Modules | Credits | TAF | SSD |
---|
3° Year activated in the A.Y. 2011/2012
Modules | Credits | TAF | SSD |
---|
Due insegnamenti a scelta
Un insegnamento a scelta
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Modules | Credits | TAF | SSD |
---|
Due insegnamenti a scelta
Un insegnamento a scelta
Legend | Type of training activity (TTA)
TAF (Type of Educational Activity) All courses and activities are classified into different types of educational activities, indicated by a letter.
Informational Methods (2009/2010)
Teaching code
4S00995
Teacher
Coordinator
Credits
6
Language
Italian
Scientific Disciplinary Sector (SSD)
INF/01 - INFORMATICS
Period
2nd Semester dal Mar 1, 2010 al Jun 15, 2010.
Learning outcomes
The course intends to present the fundamental discrete structures, by stressing their role in the analysis of biological phenomena.
Program
Discrete structures: numbers, sets, sequences, multisets, strings, operations, trees, and graphs. Languages, automata, and grammars: linear patterns and regular expressions, replacement and types of rules, computation machines. Biological aggregates: bilinear strings and DNA operations, genomes and evolution trees, multiset transformations, membrane systems and protocells, reaction graphs and metabolic dynamics, methods and problems of synthetic biology. Numbers and induction: number systems, number representations, inductive definitions of important numerical sequences, and structural induction on strings, trees and graphs. Elements of combinatorics: allocations and partitions, binomial coefficients, Stirling approximation, numbers of Stirling, Bell and Catalan, alignments, magnitude and asynthotic orders, analytical versus recurrent and generative enumeration formulae. Outlines of discrete probability. Biological nets and connectivity indexes.
Examination Methods
Written and oral examination.