Department of Computer Science | Institute of Theoretical Computer Science | CADMO

Theory of Combinatorial Algorithms

Prof. Emo Welzl and Prof. Bernd Gärtner

Mittagsseminar (in cooperation with A. Steger, D. Steurer and B. Sudakov)

Mittagsseminar Talk Information

Date and Time: Thursday, August 15, 2013, 12:15 pm

Duration: 30 minutes

Location: OAT S15/S16/S17

Speaker: Chengzhe Tian

Extending Network Motifs by Monotone Systems (Master Thesis)

A central problem of systems biology is to understand large biological networks and to design artificial ones, but this problem proves to be very difficult because biological networks are large, nonlinear, have spatial organization and noise. Traditional methods such as graph-based methods and ODE/PDE-based methods show their limitations in practice. In this thesis, we propose a new approach of combining network motifs and monotone systems. This method can potentially analyze large networks without losing the consideration of interaction mechanisms. Analysis shows that we only need to calculate a few values (called "performance criteria") in order to predict the behavior of the extended system exactly, no matter how complicated that system is.
This thesis is supervised by Dr. Kaltenbach and Prof. Stelling in D-BSSE, ETH Zurich. Please note that the contents are not so related to the current research in the institute of theoretical computer science.

Upcoming talks     |     All previous talks     |     Talks by speaker     |     Upcoming talks in iCal format (beta version!)

Previous talks by year:   2024  2023  2022  2021  2020  2019  2018  2017  2016  2015  2014  2013  2012  2011  2010  2009  2008  2007  2006  2005  2004  2003  2002  2001  2000  1999  1998  1997  1996  

Information for students and suggested topics for student talks

Automatic MiSe System Software Version 1.4803M   |   admin login