Download presentation
Presentation is loading. Please wait.
Published byBathsheba Gregory Modified over 8 years ago
1
BLAST BNFO 236 Usman Roshan
2
BLAST Local pairwise alignment heuristic Faster than standard pairwise alignment programs such as SSEARCH, but less sensitive. Online server: http://www.ncbi.nlm.nih.gov/blast http://www.ncbi.nlm.nih.gov/blast
3
BLAST 1.Given a query q and a target sequence, find substrings of length k (k-mers) of score at least t --- also called hits. k is normally 3 to 5 for amino acids and 12 for nucleotides. 2.Extend each hit to a locally maximal segment. Terminate the extension when the reduction in score exceeds a pre- defined threshold 3.Report maximal segments above score S.
4
Finding k-mers quickly Preprocess the database of sequences: – For each sequence in the database store all k-mers in hash- table. – This takes linear time Query sequence: – For each k-mer in the query sequence look up the hash table of the target to see if it exists – Also takes linear time
Similar presentations
© 2025 SlidePlayer.com. Inc.
All rights reserved.