ISRO | ISRO CS 2008 | Question 68

In DNA sequence alignment, which string-matching algorithm is commonly used to identify similarities between two DNA sequences efficiently?

(A)

Rabin-Karp algorithm

(B)

Knuth-Morris-Pratt algorithm

(C)

Z function

(D)

None of the above

Answer: (D)

Explanation:

In DNA sequence alignment, other specialized algorithms like the Smith-Waterman algorithm or Needleman-Wunsch algorithm are commonly used instead of the Rabin-Karp algorithm, Knuth-Morris-Pratt algorithm, or Z function.

Quiz of this Question
Please comment below if you find anything wrong in the above post

My Personal Notes arrow_drop_up

Save