lect 14 BLAST

lect 14 BLAST - Bioc 2808 Lecture 14 BLAST Instructor Click...

Info iconThis preview shows pages 1–5. Sign up to view the full content.

View Full Document Right Arrow Icon
Click to edit Master subtitle style 7/29/10 Bioc 2808 Lecture 14 BLAST Instructor Dr. Junwen Wang
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
7/29/10 Searching a database We search databases to see if there are sequences similar to our sequence. If there are none, perhaps we have something new! If we find matching sequences we may be able to infer the function of our sequence from the information already known about the matched sequences.
Background image of page 2
7/29/10 Database Searches Searches must be fast. Database growth is exponential. People are even more impatient. Since we compare one sequence to many (maybe millions), we must expect matches (if any) of our query to be to only parts of the sequences on the database. That is we must use
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
A Database Search We locally align our sequence to each sequence on the database. Dynamic programming can be used if we are very interested in the most accurate result, but it will be very slow. Cannot align genomes to genomes without cluster (super) computers. We normally use a fast, approximate
Background image of page 4
Image of page 5
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/29/2010 for the course BIOC BIOC2808 taught by Professor Dr.jjwang during the Fall '09 term at HKU.

Page1 / 29

lect 14 BLAST - Bioc 2808 Lecture 14 BLAST Instructor Click...

This preview shows document pages 1 - 5. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online