1 / 25

Database Searching for Similar Sequences

Database Searching for Similar Sequences. Search a sequence database for sequences that are similar to a query sequence provide a list of database sequences with which the query sequence can be aligned well Key issue: efficiency. Database Searching for Similar Sequences Methods.

spence
Download Presentation

Database Searching for Similar Sequences

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Database Searching for Similar Sequences • Search a sequence database for sequences that are similar to a query sequence • provide a list of database sequences with which the query sequence can be aligned well • Key issue: efficiency

  2. Database Searching for Similar Sequences Methods • Smith-Waterman requires order N2L computations • Popular database searching methods (heuristic methods) • FASTA [Pearson & Lipman, 1988] • BLAST [Altschul et al., 1990] • Tradeoffs of using the heuristic fast method • Accuracy (Sensitivity and Selectivity)

  3. FASTA • Problem with Smith-Waterman algorithm: Too many calculations “wasted” by comparing regions that have nothing in common • Initial insight: Regions that are similarbetween two sequences are likely to share short stretches that are identical • Basic method: Look for similar regions only near short stretches that match exactly --- “Hit and extend” sequence searching

  4. 1 2 3 4 5 6 7 8 9 10 11 A s = H A R F Y A A Q I V L F H 1 2 3 4 5 6 7 8 I t = V D M A A Q I A L Look-up table Q R V Y … Offset vector -7 -6 -5 -4 -3 -2 -1 0 +1 +2 +3 +4 +5 +6 +7 +8 +9 +10 Diagonal Method Example 2 ,6 ,7 4 1 9 11 8 +9 -2 +2 +3 -3 +1 +2 +2 +2 -6 -2 -1 3 offset 10 5 1 1 2 1 1 1 3 2 1 4 1 1

  5. Limitations of FASTA • FASTA can miss significant similarity since: • For nucleic acids, due to codon “wobble”, DNA sequences may look like XXy where X’s are conserved and y’s are not • GGuUCuACgAAg and GGcUCcACaAAA both code for the same peptide sequence (Gly-Ser-Thr-Lys) but they don’t match with k-tuple size of 3 or higher • For proteins, similar sequences do not have to share identical residues • Gly-Asp-Gly-Lys-Gly is quite similar to Gly-Glu-Gly-Arg-Gly but there is no match with k-tuple of size 2 • Asp-Lys-Val is quite similar to Glu-Arg-Ile yet it is missed even with k-tuple size of 1 Score ? Score ? Ala-Ala-Ala-Ala-Ala vs Ala-Ala-Ala-Ala-Ala Score ?

  6. BLAST • What does BLAST stand for? • Basic Local Alignment Search Tool

  7. BLAST • BLAST is similar to FASTA but it searches for words which score above Trather than that match exactly.It is also faster because its implementation has been optimized to work with parallel UNIX architecture from an early stage. • Reference • S. F. Altschul, W. Gish, W. Miller, E. W. Myers and D. J. Lipman. Basic Local Alignment Search Tool. J. Mol. Biol. 215:403-410 (1990)

  8. BLAST basics • BLAST is mainly a 3-step algorithm: • Compile list of high-scoring strings (words) • Search for hits – each hit gives a seed • Extend seeds to obtain segment pairs

  9. BLAST • For protein sequences, the list of high-scoring words consists of all words with w characters that scores at least T with some word in the query sequence (w = 3 or 4 for protein search, 11 or 12 for nucleotide sequences). • Search for “hits” using a hash table or a finite state machine. • Key concept: Searching for words which score above Trather than that match exactly

  10. BLAST method for proteins 1. Compile a list of words which give a score above T when paired with the query sequence. • Example using PAM-120 for query sequence ACDE (w=4, T=17): A C D E ACDE = +3 +9 +5 +5 = 22 • try all possibilities: AAAA = +3 -3 0 0 = 0 no good AAAC = +3 -3 0 -7 = -7 no good • ...too slow, try directed change

  11. Generating word list A C D E ACDE = +3 +9 +5 +5 = 22 • change 1st pos. to all acceptable substitutions gCDE = 1 9 5 5 = 20 ok (=pCDE,sCDE,tCDE) nCDE = 0 9 5 5 = 19 ok (=dCDE,eCDE, nCDE,vCDE) iCDE = -1 9 5 5 = 18 ok (=qCDE) kCDE = -2 9 5 5 = 17 ok (=mCDE) • change 2nd pos.: can't - all alternatives negative and the other three positions only add up to 13 • change 3rd pos. in combination with first position gCnE = 1 9 2 5 = 17 ok • continue - use recursion

  12. BLAST method for proteins 2. Scan the database for hits with the compiled list of words. • Use finite state machine (actually used) • Calculate a state transition table that tells what state to go to based on the next character in the sequence 3. Extend hits in both directions to form segment pairs (without allowing gaps)

  13. a a a a b a b a c a a 4 7 2 3 0 5 1 6 b b BLAST method for proteins • Example of a finite state machine for string matching: (input alphabet: a,b,c) Word: ababaca Database sequence: bcabccaaababacababacabb

  14. exercise • Construct a finite state machine that recognize the word: ATG • Assuming the sequence is a nucleotide sequence

  15. BLAST Method for DNA 1. Make list of all words of length w in the query sequence (often w=11 or 12) 2. Compress database by packing 4 nucleotides into a single byte (use auxiliary table to tell you where sequences start and stop within the compressed database) -- doesn't allow for unspecified bases (wildcards)

  16. BLAST Method for DNA 3. Compress the words from the query sequence the same way. 4. Search the compressed database for matches with the compressed words Since all frames of the query sequence are considered separately, any match of length w>=11 must contain a match of length 8 that lies on a byte boundary of one of the words from the query sequence. Thus can scan a (packed) byte at a time, improving speed 4-fold over comparing one nucleotide at a time.

  17. Low-Complexity Regions • Low-complexity regions are segments that contains certain bases or amino acid more often than one would expect in “normal” nucleotide or protein sequences. • Problem: if query sequence has a stretch of unusual base composition (e.g., A-T rich) or a repeated sequence element (e.g., Alu sequence) there will be many hits with "uninteresting" regions.

  18. Low-Complexity Regions • Solution : • Make a list of the words occurring very frequently (more frequently than expected by chance). • Remove these words from the query list of words before searching database. (The words are replaced by strings of Xs.)

  19. BLAST Statistical significance • A key to the utility of BLAST is the ability to calculate expected probabilities of occurrence of maximum segment pairs (MSPs) given w and T • This allows BLAST to rank matching sequences in order of “significance” and to cut off listings at a user-specified probability

  20. Choosing Values for w and T • Trade-off: sensitivity vs. running-time • Choosing a value for w • Small w: many matches to expand • Big w: many words to be generated • w=3/4 is a good compromise • Choosing a value for T • Small T: greater sensitivity, more matches to expand

  21. BLAST Notes • May fail to find optimal MSPs • May miss seeds if T is too stringent • Empirically, 10 to 50 times faster than Smith-Waterman

  22. Basic BLAST Family • BLASTN • DNA to DNA database • BLASTP • protein to protein database • TBLASTN • DNA (translated) to protein database • BLASTX • protein to DNA database (translated) • TBLASTX • DNA (translated) to DNA database (translated)

  23. BLAST Refinements • gapped alignments • “two-hit” method for extending word pairs • Iterate with position-specific matrix (PSI-BLAST) • Pattern-hit initiated BLAST (PHI-BLAST)

More Related