6.096 | Spring 2005 | Undergraduate

Algorithms for Computational Biology

Lecture Notes

lecture5.pdf

Description:

This file explains comparing genomes, comparing two DNA sequences, re-use computation, memoization, dynamic programming, matrix representation of alignments, matrixSequence alignment, and global alignment.

Resource Type:
Lecture Notes
pdf
2 MB
lecture5.pdf
Download File
DOWNLOAD

Course Info

Departments
As Taught In
Spring 2005
Level
Undergraduate
Topics
Learning Resource Types
Lecture Notes
Programming Assignments
Problem Sets
Download Course
MIT Open Learning
Over 2,500 courses & materials
Freely sharing knowledge with learners and educators around the world. Learn more
© 2001–2024 Massachusetts Institute of Technology
Accessibility
Creative Commons License
Terms and Conditions
Proud member of:
© 2001–2024 Massachusetts Institute of Technology