270193 VU (Introduction to) Network analysis with Python (2023S)
Continuous assessment of course work
Labels
Registration/Deregistration
Note: The time of your registration within the registration period has no effect on the allocation of places (no first come, first served).
- Registration is open from Fr 10.02.2023 14:00 to Su 26.02.2023 23:59
- Deregistration possible until Su 26.02.2023 23:59
Details
max. 20 participants
Language: German
Lecturers
Classes (iCal) - next class is marked with N
The course times are:
* Wednesday 15.03.2023 11:45 - 17:15
* Monday 20.03.2023 11:30 - 17:00
* Wednesday 22.03.2023 11:45 - 17:15
* Monday 27.03.2023 11:30 - 17:00
* Friday 31.03.2023 09:30 - 15:00
The first half of each day is a lecture, the second half are practical exercises. Option to stay longer (or leave earlier) depending on how long you need for the exercises & assignments.
There will be a 1 hour lunch break.
- Wednesday 15.03. 11:45 - 18:45 Seminarraum 3 Organische Chemie 1OG Boltzmanngasse 1
- Monday 20.03. 11:30 - 18:30 Seminarraum 3 Organische Chemie 1OG Boltzmanngasse 1
- Wednesday 22.03. 11:45 - 18:45 Seminarraum 3 Organische Chemie 1OG Boltzmanngasse 1
- Monday 27.03. 11:30 - 18:30 Seminarraum 3 Organische Chemie 1OG Boltzmanngasse 1
- Friday 31.03. 09:30 - 16:30 Seminarraum 3 Organische Chemie 1OG Boltzmanngasse 1
Information
Aims, contents and method of the course
Assessment and permitted materials
Assessments• Participation in lectures and practicals
• Oral presentation of a research paper
• Python programming assignment
• Oral presentation of the programming assignment
• Oral presentation of a research paper
• Python programming assignment
• Oral presentation of the programming assignment
Minimum requirements and assessment criteria
The course is designed to be an introduction to network science and to programming. Students are not expected to have prior programming experience. Course attendance is mandatory. Students may be excused for one day unless otherwise agreed upon. 50% of the maximal points, as outlined below, must be attained to pass the course.Marking SchemeA maximum of 100 points can be achieved in the course. The 100 points are divided into:
• Participation in lectures and practicals: 20 points
• Research paper presentation: 20 points
• Programming assignment: 40 points
• Programming presentation: 20 pointsGrades will be assigned as follows:
• 1 (excellent): 100-89 points
• 2 (good): 88-76 points
• 3 (satisfactory): 75-63 points
• 4 (sufficient): 62-50 points
• 5 (insufficient): 49-0 points
• Participation in lectures and practicals: 20 points
• Research paper presentation: 20 points
• Programming assignment: 40 points
• Programming presentation: 20 pointsGrades will be assigned as follows:
• 1 (excellent): 100-89 points
• 2 (good): 88-76 points
• 3 (satisfactory): 75-63 points
• 4 (sufficient): 62-50 points
• 5 (insufficient): 49-0 points
Examination topics
There are no restrictions with regards to the resources that students can use to complete their assignment(s), provided that all work submitted/ presented for assessment is original and has not been plagiarised. All assessments are based on the materials provided during the course.
The additional reading materials may be used to gain a deeper understanding of the content provided in the lectures and practicals. Student may be expected to read some of the additional material(s) in order to gain full marks.
The additional reading materials may be used to gain a deeper understanding of the content provided in the lectures and practicals. Student may be expected to read some of the additional material(s) in order to gain full marks.
Reading list
Reading MaterialsA majority of the course material is based on the following textbook and chapters:Barabasi, A.-L. & Marton, P. (2016) Network Science. Cambridge University Press. [available online at http://networksciencebook.com/]
• Chapter 1 -5, 8-9The course is supplemented with examples from the following research papers and others:Barabási, A., Oltvai, Z. (2004) Network biology: understanding the cell’s functional organization. Nature Reviews Genetics. 5, 101–113.Barabási, A.-L., Gulbahce, N. & Loscalzo, J. (2011) Network Medicine: A Network-based Approach to Human Disease. Nature Review Genetics. 12,56-68.Compeau, P.E.C., Pevzner, P.A. & Tesler, G. (2011) Why are de Bruijn graphs useful for genome assembly? Nature Biotechnology. 29, 987-991.Firth, J.A., Hellewell, J., Klepac, P., Kissler, S., CMMID COVID-19 Working Group, Kurcharski, A.J., Spurgin, L.G. (2020) Using a real-world network to model localized COVID-19 control strategies. Nature Medicine. 26, 1616-1622.Motter, A.E., Gulbahce, N., Almaas, E. & Barabási, A.-L. (2008) Predicting synthetic rescues in metabolic networks. Molecular Systems Biology. 4, 168.Orth, J., Thiele, I. & Palsson, B. (2010) What is flux balance analysis? Nature Biotechnology. 28, 245–248.Jeong, H., Mason, S.P., Barabási, A.-L. & Oltvai, Z.N. (2001) Lethality and centrality in protein networks. Nature, 411: 41-42.Watts, D.J. & Strogatz, S.H. (1998) Collective dynamics of ‘small-world’ networks. Nature. 393, 440-442.
• Chapter 1 -5, 8-9The course is supplemented with examples from the following research papers and others:Barabási, A., Oltvai, Z. (2004) Network biology: understanding the cell’s functional organization. Nature Reviews Genetics. 5, 101–113.Barabási, A.-L., Gulbahce, N. & Loscalzo, J. (2011) Network Medicine: A Network-based Approach to Human Disease. Nature Review Genetics. 12,56-68.Compeau, P.E.C., Pevzner, P.A. & Tesler, G. (2011) Why are de Bruijn graphs useful for genome assembly? Nature Biotechnology. 29, 987-991.Firth, J.A., Hellewell, J., Klepac, P., Kissler, S., CMMID COVID-19 Working Group, Kurcharski, A.J., Spurgin, L.G. (2020) Using a real-world network to model localized COVID-19 control strategies. Nature Medicine. 26, 1616-1622.Motter, A.E., Gulbahce, N., Almaas, E. & Barabási, A.-L. (2008) Predicting synthetic rescues in metabolic networks. Molecular Systems Biology. 4, 168.Orth, J., Thiele, I. & Palsson, B. (2010) What is flux balance analysis? Nature Biotechnology. 28, 245–248.Jeong, H., Mason, S.P., Barabási, A.-L. & Oltvai, Z.N. (2001) Lethality and centrality in protein networks. Nature, 411: 41-42.Watts, D.J. & Strogatz, S.H. (1998) Collective dynamics of ‘small-world’ networks. Nature. 393, 440-442.
Association in the course directory
AN-2, BC-1, CHE II-1, BC-CHE II-8, CH-CBS-05, Design
Last modified: Tu 28.03.2023 13:49
• Discussion of different network types and examples of real networks
• Introduction to analysing networks in Python using the networkx package
• Discussion of functionalising code, good coding practices and writing pseudo code
• Genome-scale modelling of metabolic networksMethodThe course will be divided into lectures and programming practicals. Each set of theory will be followed by examples on how to implement the theory in Python and a set of programming tasks. A combination of course participation, presentations and a programming assignment will be used to assess the material covered in the lectures and practicals.To complete the practical tasks of this course, students will require access to a computer or laptop with a web browser. Programming tasks are designed to be hosted on a server which has the required software pre-installed and to which students enrolled in the course will be granted access.The course will be instructed in English.