Home
Project
Workshop
Nodal Centres
Apply for Nodal Centre Program
Nodal Centre List
Free online demo
Nodal Centre Inaugurations
Unique Login ID
News & Events
Publications
Survey
Faculty Survey
Student Survey
Contact us
Login
.
you are here->
home
->
Biotechnology and Biomedical Engineering
->
Bioinformatics Virtual Lab II
->
Smith-Waterman Algorithm - Local Alignment of Sequences
.
.
Smith-Waterman Algorithm - Local Alignment of Sequences
.
.
Theory
Procedure
Self Evaluation
Simulator
Assignment
Reference
Feedback
1)
which is the best algorithm for sub sequence alignment ?
Needleman-Wunsch Algorithm
Clustal W
Smith-Waterman Algorithm
Multiple sequence alignment Algorithm
2)
Give an example algorithm name of Dynamic programming?
Clustal Omega
Needleman-Wunsch algorthim
Edman Degradation approach
Clustal X
3)
what is the structural difference between Dideoxy nucleotides and nucleotides ?
Hydrogen group on 5' carbon
Hydroxyl group on 3' carbon
Hydrogen group on 3' carbon
Hydroxyl group on 5' carbon
4)
Name one method for DNA sequencing?
Sanger method
Edman Degradation
Mass spectrometry
X- ray crystallography
5)
Name one predefined substitution matrices ?
Clustal
PAM
BLOSUM
PAM and BLOSUM
Cite this Simulator:
vlab.amrita.edu,. (2012). Smith-Waterman Algorithm - Local Alignment of Sequences. Retrieved 9 December 2024, from vlab.amrita.edu/?sub=3&brch=274&sim=1433&cnt=3
.....
.....
.....
Copyright @ 2024 Under the NME ICT initiative of MHRD
Powered by
Amrita
Virtual Lab Collaborative Platform
[ Ver 00.13. ]