For more information about this meeting, contact Tim Reluga, Stephanie Zerby, Andrew Belmonte, Chun Liu, Minxin Chen, Ying Yang.
|Title:||Exact model reductions for asynchronous boolean networks|
|Seminar:||Mathematical Biology and Physiology Seminar|
|Speaker:||Tim Reluga, Math and Bio, Penn State|
|Boolean networks are a class of finite-state machines used to model cellular biological processes. Boolean networks have a simpler state-space than classical differential equation models and can be easier to parameterize based on qualitative laboratory observations. However, the state spaces still scale exponentially with network size, and model-reduction techniques are very useful in transforming tangled networks into easier-to-understand versions. In this talk, I'll discuss a couple intuitive reduction rules and the challenges of proving basic properties of these rules. Ideas will draw from directed graph theory, topology, modern algebra, and dynamic systems.|
Room Reservation Information
|Date:||01 / 24 / 2014|
|Time:||12:00pm - 01:00pm|