Difference between revisions of "Lecture 11"
Jump to navigation
Jump to search
Line 25: | Line 25: | ||
======Slide 003====== | ======Slide 003====== | ||
[[Image:L11_s003.jpg|frame|none|Lecture 11, Slide 003<br> | [[Image:L11_s003.jpg|frame|none|Lecture 11, Slide 003<br> | ||
+ | The observation became famously known as "Levinthal's Paradox, that neither random search nor the postulation of folding pathways can explain how a discrete structure can self-organize, given in a combinatorially large search space. But real proteins do just fine, thank you. | ||
+ | ]] | ||
− | |||
======Slide 004====== | ======Slide 004====== | ||
[[Image:L11_s004.jpg|frame|none|Lecture 11, Slide 004<br> | [[Image:L11_s004.jpg|frame|none|Lecture 11, Slide 004<br> |
Revision as of 06:34, 28 November 2006
(Previous lecture) ... (Next lecture)
Protein Structure Prediction
...
Add:
- Summary points
- Exercises
- Further reading