What problem was addressed by Smith and Waterman (1981a,b) in their modification of the Needleman-Wunsch algorithm?a: Assessing the significance of alignment scoresb: Locating significant regions in DNA and protein sequencesc: Determining sequence identityd: Predicting protein structures
Question
What problem was addressed by Smith and Waterman (1981a,b) in their modification of the Needleman-Wunsch algorithm?a: Assessing the significance of alignment scoresb: Locating significant regions in DNA and protein sequencesc: Determining sequence identityd: Predicting protein structures
Solution
Smith and Waterman (1981a,b) addressed the problem of locating significant regions in DNA and protein sequences in their modification of the Needleman-Wunsch algorithm. Their algorithm was designed to find local alignments, or the most similar regions between two sequences, rather than global alignments, which is what the original Needleman-Wunsch algorithm was designed for. This made it particularly useful for comparing sequences with only small regions of similarity.
Similar Questions
Global alignments are based on the Needleman–Wunsch algorithm True False
Which one of the following is used for global alignment of two protein sequences?(A) Chou-Fasman method(B) Garnier-Osguthorpe-Robson (GOR) method(C) Needleman-Wunsch algorithm(D) Smith-Waterman algorithm
Which of the following tools can be used for local alignment: BLAST Clustal Omega Needleman–Wunsch algorithm KEGG
Which program is commonly used for aligning three or more sequences simultaneously?a: Needleman-Wunschb: Gibbs samplingc: PILEUPd: CLUSTALW
Which of the following is NOT used for generating an optimal alignment of twonucleotide sequences?(A) Gap penalties(B) Match scores(C) Mismatch scores(D) Nucleotide composition
Upgrade your grade with Knowee
Get personalized homework help. Review tough concepts in more detail, or go deeper into your topic by exploring other relevant questions.