GATE 2023 BT – Question 27
Which one of the following is used for global alignment of two protein sequences?
Practise this question in The GATE Grind →
Show answer and explanation
Correct answer: (C) Needleman-Wunsch algorithm
Explanation
**Global alignment** aligns two sequences over their whole length.
- **Needleman-Wunsch:** a dynamic-programming algorithm that gives the best **global** alignment. ✓
- **Smith-Waterman:** a dynamic-programming algorithm for the best **local** alignment.
- **Chou-Fasman and GOR:** secondary-structure prediction methods, not alignment algorithms.
Answer **Needleman-Wunsch** (C).