Bioinformatics 1: lecture 7 - PowerPoint PPT Presentation

1 / 21
About This Presentation
Title:

Bioinformatics 1: lecture 7

Description:

Yu YK, Wootton JC, Altschul SF. The compositional adjustment ... Smith & Waterman. Relatively slow, but more sensitive, and more selective, than FASTA and BLAST ... – PowerPoint PPT presentation

Number of Views:72
Avg rating:3.0/5.0
Slides: 22
Provided by: chrisby
Category:

less

Transcript and Presenter's Notes

Title: Bioinformatics 1: lecture 7


1
Bioinformatics 1 lecture 7
Statistics for pairwise alignments Database
searching using FASTA Database searching using
BLAST NCBI/Seqlab exercises
2
You have seen....
Dynamic programming Global alignment
Global/local alignment (no end gaps. 3 ways to
do it.) Local alignment Linear gap
penalty Affine gap penalty
How many ways are there to do DP?
3
Asymetric substitution matrices
Recent development
If two different species have different amino
acid compositions, then the substitutions between
those species are assymetric, meaning Si?j ?
Sj?i
Clostridium tetani (AT-rich)
ACDEFGHIKLMNPQRSTVWY
match score
For example, if tetanus has more leucine overall
that tuberculosis. Then, on average
SXtetan-gtLtuber gt SLtetan-gtXtuber
ACDEFGHIKLMNPQRSTVWY
Mycobacterium tuberculosis (GC-rich),
(where X is any amino acid)
Yu YK, Wootton JC, Altschul SF. The
compositional adjustment of amino acid
substitution matrices. Proc Natl Acad Sci U S A.
2003 Dec 23100(26)15688-93.
4
Database searching
GenBank, PIR, Swissprot, GenEMBL, DDBJ
one sequence
lots of sequences
Why do a database search? Mol. Bio Determination
of gene function. Primer design. Pathology,
epidemiology, ecology Determination of species,
strain, lineage, phylogeny. Biophysics
Prediction of RNA or protein structure, effect of
mutation.
5
Searching millions of sequences
Given a protein or DNA sequence, we want to find
all of the sequences in GenBank (over 17 million
sequences!!) that have a good alignment
score. Each alignment score should be the optimal
score (or a close approximation). How do we do
it?
6
DNA or Protein search?
  • Advantages of searching DNA databases
  • Disadvantages
  • Advantages of searching protein sequences
  • Disadvantages

Larger database. Does not assume a reading frame.
Can find similarity in non-coding regions
(introns, promotor regions). Can find frameshift
mutations. Can find pseudogenes.
Slower. Not as sensitive. Ignores selective
pressure at the protein level.
Faster. More sensitive. More biologically
relevant.
Not applicable to non-coding DNA (promotors,
introns, etc)
7
Searching using Dynamic Programming
SSEARCH
Smith Waterman
DP returns the optimal alignment, given the
scoring function (usually affine gap local
alignment)
Relatively slow, but more sensitive, and more
selective, than FASTA and BLAST Optimal.
8
sensitivity, selectivity
9
Searching using word matches
FASTA
W. Pearson, 1988
First searches for k-tuples, then links them.
Results are similar to a dot plot. Finally,
diagonals are scored using a substitution matrix,
and the highest-scoring diagonals are
joined. High-scoring alignments are re-calculated
using DP (local/affine).
At least 50-times faster than SSEARCH. Not as
sensitive. Final DP step makes it more
sensitive, but less selective. FASTA is a
Heuristic alignment method, not Optimal.
10
heuristic
11
FASTA
k-tuplesk2
CDGGAALP
Finding identity matches is very fast. If two
k-tuples are separated by exactly the same amount
in both sequence, draw a diagonal. A gapless
alignment.
CDEEDDLP
12
FASTA
Score them using BLOSUM, keep the best
Connect them using simple affine gap. (gap ext.
0)
Find all gapless alignments
If this alignment one of the best scores in the
database search, go back and realign using DP.
13
Searching using lookup tables
BLAST
S. Altschul et al.
First make a set of lookup tables for all
3-letter (protein) or 11-letter (DNA) matches.
Make another lookup table the locations of all
3-letter words in the database. Start with a
match, extend to the left and right until the
score no longer increases.
Very fast. Selective,but not as sensitive as
SSEARCH. Good statistics. Heuristic.
14
BLAST
8000 3-tuples
... PGQ PGR PGS ... PGT PGV PGW PGY PAQ PCQ PDQ
PEQ PFQ ... ...
50 high-scoring 3-tuples
PGQ
Each 3-tuple is scored against all 8000 possible
3-tuples using BLOSUM. The top scoring 50 are
kept.
15
BLAST
query sequence
database sequence
a 3-tuple
50 high-scoring 3-tuples
neighborhood words
identity matches
seeds
HSPs
For every 3-residue window, we get the set of 50
nearest neighbors. Use each word to get identity
matches (seeds). Then extend the seed alignments
as long as the score increases.
16
BLAST
HSPs
alignment
The best extended seeds are called HSPs (high
scoring pairs). The top scoring HSP is picked
first, then the second (as long as it falls
"northwest" or "southeast" of the first.), and so
on.
17
BLAST search using NCBI
In class exercise.
  • Open a web browser.
  • Go to NCBI-BLAST (www.ncbi.nlm.nih.gov/BLAST/)
    and select " Nucleotide-nucleotide BLAST
    (blastn) "
  • Login to bioinf45
  • type 'more bystroff/evidence.fasta'
  • Copy/paste the DNA sequence into the Blast
    sequence window. Select 'nr'. Select
    Descriptions10, Alignments10. Run it. Format
    it.
  • When the results are back, go to the bottom of
    the page. Hit "Select all" and "Get selected
    sequences"
  • continued.....

18
BLAST search using NCBI
In class exercise.
  • In the page that appears, select DisplayGenBank,
    and SendtoFile.
  • Send this file to your account on bioinf45, using
    a scp command.
  • Go to SeqLab. Go to an empty Editor page. Import
    the GenBank file.

19
Doing a simple multiple sequence alignment.
Another class exercise.
This exercise is to practice making a multiple
sequence alignment using the local databases. Try
it using BLAST first. Then try FASTA and SSEARCH
database searches. Do you get different results?
20
BLAST search using SeqLab
In class exercise.
  • start SeqLab
  • Using LookUp, Find sequences in PIR that match
    the keyword "R67". Check the results. Choose the
    PIR sequence. What is the accession number?
  • Get the sequence using File/Add sequences
    from/Databases, using the accession number
  • Run BLAST using this sequence. Be sure to search
    the protein databases. Set the cutoff to 10.0
  • Add to Main list. Go to Main list, select it. Go
    to Editor. (Choose to Modify the sequences. This
    cuts off long ends)

21
Multiple sequence alignment search using SeqLab
In class exercise.
  • Select all sequences. Run ClustalW multiple
    alignment.
  • Extensions--gtClustalW (use the defaults)
  • When the job is done, save to Main list. Then
    select it, and go to the Editor.
  • You should now see a multiple sequence alignment.
Write a Comment
User Comments (0)
About PowerShow.com