Skip to main content

Bioinformatics Analysis:Smith Waterman Algorithm

Demonstration of SmithWaterman Algorithm
In this tutorial I've demonstrated the implementation of SmithWaterman Algorithm.
The Smith Waterman algorithm is a dynamic programming algorithm that builds a real or implicit array where each cell of the array represents a sub problem in the alignment problem discovered by Smith and Waterman in 1981.
Part 1
Part 2


Part 3


Smith Waterman Algorithm
This Algorithm takes alignments of any length, at any location, in any sequence, and determines whether an optimal alignment can be found. Based on these calculations, scores or weights are assigned to each character to character comparison.
  • Positive for exact matches/substitutions.
  • Negative for insertions/deletions.
  • In weight matrices, scores are added together and the highest scoring alignment is reported.
Goal of Smith Waterman Algorithm

It finds solutions to smaller pieces of the problem and then puts them all together to form a complete and optimal final solution to the entire problem.

Why Smith Waterman Algorithm is superior to other Algorithms?

  1. It is superior to the BLAST and FASTA algorithms because it searches a larger field of possibilities.
  2. It is a more sensitive technique in aligning the sequences.
  3. Instead of looking at the entire sequence at once,Smith Waterman compares multi lengthed segments.
  4. The algorithm itself is recursive in nature.
Thank you
Will be waiting for your feedback.

Comments

Popular posts from this blog

A Complete Guide for Autodock Vina

 Hello Everyone, In the following video we will explain how to use Autodock Vina for Molecular Docking. The video contains details about Downloading Installation Protein-Ligand Docking Tutorial

Downloading sequencing data on windows - SRA Tool kit - Step 1

  This is the first part of the lecture series on analyzing sequencing data. The first step is to configure SRA Tool kit on your operating system. #NGS #Sequencing #SRA #Tool #Configuration

PHYLOGENETIC ANALYSIS: ROOTED AND UNROOTED TREES

BASIC GUIDELINE TO UNDERSTAND ROOTED AND UNROOTED TREES IN PHYLOGENETICS   What is a  PHYLOGENETIC TREE? Phylogenetic trees represent hypothesis about the evolutionary relationships among a group of organisms. A phylogenetic tree may be built using morphological (body shape), biochemical, behavioral, or molecular features of species or other groups.In building a tree, we organize species into nested groups based on shared derived traits (traits different from those of the group's ancestor). HOW TO DRAW A PHYLOGENETIC TREE? In a phylogenetic tree, the species of interest are shown at the tips of the tree's branches. The branches themselves connect up in a way that represents the evolutionary history of the species that is, how we think they evolved from a common ancestor through a series of divergence (splitting-in-two) events.For more details watch the video below: THANK YOU