Question

Which of the following is not a disadvantage of Needleman-Wunsch algorithm?

(a) This method is comparatively slow

(b) There is a need of intensive memory

(c) This cannot be applied on genome sized sequences

(d) This method can be applied to even large sized sequences

I have been asked this question in an international level competition.

Question is taken from Global Sequence Alignment in chapter Sequence Alignment of Bioinformatics

Answer 1

Right answer is (d) This method can be applied to even large sized sequences

The explanation is: This method cannot be applied on genome sized sequences. But this is indeed useful in determining similarities and evolutionary relationships.