Question

A global alignment algorithm (such as the Needleman-Wunsch algorithm) is guaranteed to find an optimal alignment. Such an algorithm:________.
A) Puts the two proteins being compared into a matrix and finds the optimal score by exhaustively searching every possible combination of alignments.
B) Puts the two proteins being compared into a matrix and finds the optimal score by iterative recursions.
C) Puts the two proteins being compared into a matrix and finds the optimal alignment by finding optimal sub-paths that define the best alignment(s).
D) Can be used for proteins but not for DNA sequences %.

Answer 1

Answer:

Option (C).

Explanation:

The alignment of the particular sequence can be used to determine the property, structure or the evolutionary relationship of the particular gene. The BLAST ca be used for the alignment.

Needleman-Wunsch algorithm is used to understand the alignment of the molecules especially protein and nucleotides. In this case, the two different proteins or molecules are compared by using the optimal alignment and the sequence is then determined.

Thus, the correct answer is option (C).