BIO/CSC 295 2009F Bioinformatics

Class 08: Gene Alignments (3)

Back to Gene Alignments (2). On to Gene Alignments (4).

This outline is also available in PDF.

Held: Tuesday, 22 September 2009

Summary: We consider the Needleman-Wunsch algorithm for optimal alignments.

Related Pages:

Notes:

Overview:

Approximate Plan of Action

So, where are we going with the topics for chapter 3? Here's our approximate plan of action.

The Needleman-Wunsch Algorithm

Dynamic Programming

Beyond Scoring

An Example

Lab

Back to Gene Alignments (2). On to Gene Alignments (4).

Disclaimer: I usually create these pages on the fly, which means that I rarely proofread them and they may contain bad grammar and incorrect details. It also means that I tend to update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This document was generated by Siteweaver on Tue Dec 1 09:49:30 2009.
The source to the document was last modified on Tue Aug 25 11:38:51 2009.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CSC295/2009F/Outlines/outline.08.html.

You may wish to validate this document's HTML ; Valid CSS! ; Creative Commons License

Samuel A. Rebelsky, rebelsky@grinnell.edu

Copyright © 2009 Vida Praitis and Samuel A. Rebelsky. This work is licensed under a Creative Commons Attribution-NonCommercial 2.5 License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc/2.5/ or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.