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
->
Global alignment of two sequences - Needleman-Wunsch Algorithm
.
.
Global alignment of two sequences - Needleman-Wunsch Algorithm
.
.
Theory
Procedure
Self Evaluation
Simulator
Assignment
Reference
Feedback
1)
What is the main purpose of Needleman and Wunsch algorithm?
sequence alignment
pairwise sequence alignment
multiple sequence alignment
2)
What are the minimal positioned values to be known for scoring the current position?
Diagonal and left positioned values
only diagonal positioned value
Diagonal , left and above positioned value
only above positioned value
3)
Needleman-Wunsch algorithm came up with _____ approach?
Progressive alignment
Dynamic programming
Profile alignment
Dynamic and profile alignment
4)
PAM 60 specifies __________ ?
60% mutational changes
60% identical
50% identical
40% mutational changes
5)
The most dissimilar sequence can be compared to which type of alignment?
Local
Global
Dynamic algorithm
Needleman-Wunsch algorithm
Cite this Simulator:
vlab.amrita.edu,. (2012). Global alignment of two sequences - Needleman-Wunsch Algorithm. Retrieved 23 April 2024, from vlab.amrita.edu/index.php?sub=3&brch=274&sim=1431&cnt=3
.....
.....
.....
Copyright @ 2024 Under the NME ICT initiative of MHRD
Powered by
Amrita
Virtual Lab Collaborative Platform
[ Ver 00.13. ]