Computational Biology
Scribe Notes for Class 13
June 8, 2000
Scribe: D. Slotta
Today's Handouts and Announcements
None
Today's Topics
Blast (Basic Local Alignment Search Tool)
Algorithm
Determine all w-mers in q. Add all w-mers that score at least T with one of q's w-mers. This is the set of seeds.
Build finite automaton to scan for seeds.
For each seed in S
k
, add each occurrence of that seed in q or w-mer in q with a score T. (Extend seeds)
To add gaps, use dynamic programming for step 3.
Blast returns:
Length of longest segment pair.
Probability that this occurred by chance.
Statistical Estimate (see references)
Today's Sources
Setubal and Meidanis:
Section 3.5.2.
Basic Local Alignment Search Tool
: Altschul, Gish, Miller, Myers, Lipman
Gapped BLAST and PSI-BLAST: a new generation of protein database search programs
: Altschul, Madden, Schaffer, Zhang, Zhang, Miller, Lipman
Please report any problems found in these pages to:
CS6104 Account (cs6104@courses.cs.vt.edu)