Open In App
Related Articles

ISRO | ISRO CS 2008 | Question 68

Improve
Improve
Improve
Like Article
Like
Save Article
Save
Report issue
Report

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

Last Updated : 13 Jun, 2018
Like Article
Save Article
Previous
Next
Share your thoughts in the comments
Similar Reads