BIO/CSC 295 2011F Bioinformatics

Class 06: Gene Alignments (2)

Back to Gene Alignments (1). On to Gene Alignments (3).

This outline is also available in PDF.

Held: Tuesday, 13 September 2011

Summary: Today we explore two pattern matching algorithms: BLAST and Needleman-Wunsch. We consider the BLAST algorithm in two ways: Through an analysis of the first paper on BLAST and through experiments using an implementation of that algorithm. We visit Needleman-Wunsch by considering the design of the algorithm and by running it "by hand" on sample data.

Related Pages:



Having a BLAST

Our goal is to tease apart the work represented by the BLAST paper.

Some Standard Questions

Approximate Matching and Searching

The BLAST Algorithm

Exploring the Algorithm

Analyzing the BLAST Algorithm

The Needleman-Wunsch Algorithm

Dynamic Programming

Beyond Scoring

An Example of NW

Web Exploration

Back to Gene Alignments (1). On to Gene Alignments (3).

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 Nov 22 13:06:01 2011.
The source to the document was last modified on Mon Aug 22 11:16:58 2011.
This document may be found at

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

Samuel A. Rebelsky,

Copyright © 2009-2011 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 or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.