Local alignment and blast
1 / 6

Local alignment and BLAST - PowerPoint PPT Presentation

  • Updated On :

Local alignment and BLAST. Usman Roshan BNFO 601. Local alignment. Global alignment recursions: Local alignment recursions. Local alignment traceback. Let T(i,j) be the traceback matrices and m and n be length of input sequences. Global alignment traceback:

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
Download Presentation

PowerPoint Slideshow about 'Local alignment and BLAST' - loyal

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Local alignment and blast l.jpg

Local alignment and BLAST

Usman Roshan

BNFO 601

Local alignment l.jpg
Local alignment

  • Global alignment recursions:

  • Local alignment recursions

Local alignment traceback l.jpg
Local alignment traceback

  • Let T(i,j) be the traceback matrices and m and n be length of input sequences.

  • Global alignment traceback:

    • Begin from T(m,n) and stop at T(0,0).

  • Local alignment traceback:

    • Find i*,j* such that T(i*,j*) is the maximum over all T(i,j).

    • Begin traceback from T(i*,j*) and stop when

      T(i,j) <= 0.

Blast l.jpg

  • 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

Blast5 l.jpg

  • 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.

  • Extend each hit to a locally maximal segment. Terminate the extension when the reduction in score exceeds a pre-defined threshold

  • Report maximal segments above score S.

Finding k mers quickly l.jpg
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