In Smith–Waterman algorithm, in initialization Step, the _________ row and ________ column are subject to gap penalty.(a) first, first(b) first, second(c) second, First(d) first, last

In Smith–Waterman algorithm, in initialization Step, the _________ r

1.	In Smith–Waterman algorithm, in initialization Step, the _________ row and ________ column are subject to gap penalty.(a) first, first(b) first, second(c) second, First(d) first, last
Answer» The correct answer is (a) first, first The explanation: In Smith–Waterman algorithm, first row and first column are set to 0. In the Needleman Wunsch algorithm, First row and first column are subject to gap penalty.

Discussion

No Comment Found

Related InterviewSolutions

Which of the following is untrue about SCOP?(a) It is a database for comparing and classifying protein structures(b) It is constructed almost entirely based on manual examination of protein structures(c) The proteins are grouped into hierarchies of classes, folds, superfamilies, and families(d) The SCOP families consist of proteins having low sequence identity (>30%)
Which of the following statements about SCOP is incorrect regarding its features?(a) Proteins with the same shapes but having little sequence or functional similarity are placed in different super families, and are assumed to have only a very distant common ancestor(b) Proteins having the same shape and some similarity of sequence and/or function are placed in ‘families’, and are assumed to have a closer common ancestor(c) SCOP was created in 1994 in the Centre of Protein Engineering and the University College London(d) It aims to determine the evolutionary relationship between proteins
While analysing motif sequences, what is the major disadvantageous feature of PROSITE?(a) The database constructs profiles to complement some of the sequence patterns(b) The functional information of these patterns is primarily based on published literature(c) Some of the sequence patterns are too short to be specific(d) Lack of specificity about probability and variation and relation between them
Which of the following about the Gibbs sampler is untrue?(a) It is a statistical method for finding motifs in sequences(b) It is dissimilar to the principle of the EM method(c) It searches for the statistically most probable motifs(d) It can find the optimal width and number of given motifs in each sequence
In which of the following multipurpose packages Gibbs sampling algorithm is used?(a) Consensus(b) BEST(c) AlignACE(d) PhyloCon
If a good sampling of sequences is _______ the number of sequences is _________ and the motif structure is ________ it should, in principle, be possible to obtain frequencies highly representative of the same motif in other sequences also.(a) available, sufficiently large, not too complex(b) unavailable, sufficiently large, not too complex(c) unavailable, sufficiently small, not too complex(d) available, sufficiently large, too complex
Which of the following is incorrect about evolution?(a) The macromolecules can be considered molecular fossils that encode the history of millions of years of evolution(b) The building blocks of these biological macromolecules, nucleotide bases, and amino acids form linear sequences that determine the primary structure of the molecules(c) DNA and proteins are products of evolution(d) The molecular sequences barely undergo changes
For what type of sequences Gibbs sampling is used?(a) Closely related sequences(b) Distinctly related sequences(c) Distinctly related sequences that share common motifs(d) Closely related sequences that share common motifs
In the web-based program MEME, the computation is a _____ step procedure.(a) one(b) two(c) three(d) four
Gibbs is a web-based program that uses the Gibbs sampling approach to look for _____ gap-free segments for either DNA or protein sequences.(a) short, partially conserved(b) long, partially conserved(c) long, conserved(d) short, not conserved

In Smith–Waterman algorithm, in initialization Step, the _ row and column are subject to gap penalty.(a) first, first(b) first, second(c) second, First(d) first, last

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment