Q. Which of the following does not describe dynamic programming?

View solution

Q. Which of the following is not an advantage of Needleman-Wunsch algorithm?

View solution

Q. Which of the following is not a disadvantage of Needleman-Wunsch algorithm?

View solution

Q. Which of the following does not describe global alignment algorithm?

View solution

Q. Which of the following does not describe PAM matrices?

View solution

Q. Which of the following is untrue regarding the scoring system used in dynamic programming?

View solution

Q. Which of the following does not describe global alignment algorithm?

View solution

Q. Which of the following does not describe global alignment algorithm?

View solution

Q. Which of the following is wrong in case of substitution matrices?

View solution

Q. When did Smith–Waterman first describe the algorithm for local alignment?

View solution

Q. Which of the following does not describe local alignment?

View solution

Q. Which of the following does not describe local alignment algorithm?

View solution

Q. Local alignments are more used when _____________

View solution

Q. Which of the following does not describe BLOSUM matrices?

View solution

Q. Which of the following is untrue regarding the gap penalty used in dynamic programming?

View solution

Q. Among the following which one is not the approach to the local alignment?

View solution

Q. Which of the following does not describe k-tuple methods?

View solution

Q. Which of the following does not describe BLAST?

View solution

Q. Which of the following is untrue regarding BLAST and FASTA?

View solution

Q. For what type of sequences Gibbs sampling is used?

View solution