Lecture 8 Flashcards

You may prefer our related Brainscape-certified flashcards:
1
Q

Modelling in Systems Biology

A

1) Hypothesis
2) Experiment
3) Data
4) Modelling
5) Simulation

  • All models are wrong, but some are useful
  • Models are always abstractions
    -> simplifications that help understanding principles of regulation
  • modeling involve iteration cycles
    -> fit model predictions with experimental data - but how?
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Bootstrapping Example

A
  • EMT in Cancer => FOXA1 pioneering transcription factor => repressed in EMT
  • Preferential Binding to Epithelial/Mesenchymal genes?
  • Found 481 peaks in 100 genes
  • 66000 peaks altogether
  • A lot or a little binding? => use bootstrapping (10000x 100 genes selected)
  • Signi!cant binding to epithelial/mesenchymal genes
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Cross Validation

A
  • There is a dierence between model !tting & prediction
  • Can !t model to training data, but poor prediction => over!tting
  • Split data into training & test data
  • Average prediction: goodness for model
  • Use Likelihood ratio model selection -> exercises
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Genetic Algorithm

A
  • Directed search algorithm based on mechanics of biological evolution
  • reproduction -> modification -> evaluation -> population
  • Population
  • Chromosomes could be:
    -> Bit strings (0101 … 1100)
    -> Real numbers (43.2 -33.1 … 0.0 89.2)
    -> … any data structure …
  • Reproduction
    -> Parents are selected at random with selection chances biased in relation to chromosome evaluations.
  • Modi!cation
    -> Mutation => local adaptation
    -> Crossing over
    => accelerates search in early evolution of population
  • Evaluation
    -> Score !tness of individual via objective function
    -> Only link between GA & problem it solves
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Traveling Salesman Problem

A
  • Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city exactly once and returns to the origin city?
  • Complex problem, if number of cities large
  • Formulate as GA problem
    => Chromosome: ordered list of cities
    1) London 2) Venice
    3) Berlin 5) Beijing 7) Tokyo
    4) Singapore 6) Phoenix 8) Sydney
  • Objective function: sum of distances between ordered list elements
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Model Simplification

A
  • Works on the model topology to reduce number of variables & parameters
    a) Omit elements
    b) Fix elements
    c) Simplify formulas
    d) Lump elements
    e) Dynamic black box model
    f) Global flux modes
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Spatio-Temporal Organization of Life

A
  • Chemical reactions => Mathematical modeling
  • Attractors, Bifurcations, Multi-stability, Macroscopic organization * Stability & Plasticity of complex systems
  • Adiabatic elimination & Slaving Principle applicable on multiple time scales
    -> “Commanding Process” depends on time/space scale of observation

Why is Life? Because Life can!

How well did you know this?
1
Not at all
2
3
4
5
Perfectly