In DNA sequence alignment, which string-matching algorithm is commonly used to…
2008
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
Attempted by 15 students.
Show answer & explanation
Correct answer: D
DNA sequence alignment typically involves comparing sequences with potential gaps or mutations. Exact string-matching algorithms (like KMP, Rabin-Karp) search for identical substrings and do not account for biological variations. Instead, alignment relies on dynamic programming methods (e.g., Smith-Waterman) or heuristic tools (e.g., BLAST). Consequently, the specific exact-match algorithms listed are not standard for this purpose.