Game theoretic models in molecular biology
author:
Tommi Jaakkola,
MIT - Massachusetts Institute of Technology
Description
There are many challenges in computational modeling of biological processes. Few processes such as signaling pathways operate in- dependently of others but rather involve substantial coordination and shared resources. The level of abstraction appropriate for understand- ing different processes, e.g, viewing a pathway as a filter or a molecular cascade, varies by context and the type of predictions sought.
You might be experiencing some problems with Your Video player.
| Slides | |
| 0:00 | Game theoretic models in molecular biology |
| 1:12 | Abstraction, scale |
| 2:23 | Abstractions cont’d |
| 4:42 | Abstractions, predictions and data |
| 6:25 | Our approach - game theory |
| 6:39 | Some background |
| 8:50 | Our approach - game theory |
| 9:10 | Example - protein-DNA binding pt 1 |
| 9:59 | Example - protein-DNA binding pt 2 |
| 10:55 | Example - protein-DNA binding pt 3 |
| 11:09 | Example - protein-DNA binding pt 4 |
| 11:32 | DNA-binding - formulation |
| 12:32 | Transport |
| 14:06 | Local binding |
| 15:18 | Allocation to sites or regions |
| 16:22 | Mapping to game theory |
| 18:36 | DNA-binding game - strategies |
| 19:37 | DNA-binding game - utilities pt 1 |
| 20:52 | DNA-binding game - utilities pt 2 |
| 21:33 | The binding game |
| 22:20 | Understanding the binding game pt 1 |
| 23:25 | Understanding the binding game pt 2 |
| 24:42 | DNA binding game - equilibria pt 1 |
| 24:57 | DNA binding game - equilibria pt 2 |
| 25:15 | DNA binding game - computation pt 1 |
| 25:33 | DNA binding game - computation pt 2 |
| 25:53 | DNA binding game - computation pt 3 |
| 26:05 | Computation - some details |
| 27:32 | The algorithm pt 1 |
| 28:09 | The algorithm pt 2 |
| 28:10 | The algorithm pt 3 |
| 28:12 | The algorithm pt 4 |
| 28:13 | The algorithm pt 5 |
| 28:22 | The algorithm pt 6 |
| 28:23 | The algorithm pt 7 |
| 28:25 | The algorithm pt 8 |
| 28:26 | The algorithm pt 9 |
| 28:28 | The algorithm pt 10 |
| 28:29 | The algorithm pt 11 |
| 28:31 | The algorithm pt 12 |
| 28:32 | The algorithm pt 13 |
| 29:07 | Validation (lambda-phage) pt 1 |
| 31:19 | Validation (lambda-phage) pt 2 |
| 33:22 | Validation (lambda-phage) pt 3 |
| 34:03 | Genome-wide |
| 34:54 | Next steps |
| 38:38 | Acknowledgements |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





