Skip to content
Related Articles
Get the best out of our app
GeeksforGeeks App
Open App

Related Articles

ISRO | ISRO CS 2008 | Question 68

Improve Article
Save Article
Like Article
Improve Article
Save Article
Like Article

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


Rabin-Karp algorithm


Knuth-Morris-Pratt algorithm


Z function


None of the above

Answer: (D)


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
Last Updated : 13 Jun, 2018
Like Article
Save Article
Similar Reads