This is an archived course. A more recent version may be available at ocw.mit.edu.

Lecture 6

Lectures: 1 | 2 | 3 | 4-5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 | 15 | 16 | 17 | 19 | 20 | 21 | 22 | 23 | 26

Recursive Schemes

Precursors to Dynamic Programming (Another Introduction)
- Fibonacci (1175-1240)'s Rabbits
- The Pascal (1623-1662) [-Newton (1642-1717)-Yang Hui (1238-1298)-Khayyam (1048-1131)] Triangle (Page 1 (GIF) of Notes)
- Transfer Matrix Method in Statistical Mechanics, e.g. for a Directed Polymer. (Page 2 (GIF) of Notes)
Markov Processes and Transfer Matrices
- Transition Matrix
- Steady State
- Approach to Asymptotics (Page 3 (GIF) of Notes)
Sequence alignment
- Comparison of Sequences
- Gapless Alignments: Local, Global (Page 4 (GIF) of notes)
- Tutorial by Ralf Bundschuh on Sequence Alignment (and Associated Paper (PDF))

MIT OpenCourseWare makes the materials used in the teaching of almost all of MIT's subjects available on the Web, free of charge. With more than 2,000 courses available, OCW is delivering on the promise of open sharing of knowledge.

Your use of the MIT OpenCourseWare site and materials is subject to our Creative Commons License and other terms of use.

Find courses by:

Collections

Cross-Disciplinary Topic Lists

Translated Courses

Lecture 6

Recursive Schemes

Courses

About

Donate

Featured Sites

Tools

About MIT OpenCourseWare