GATE BT 2023 • Q27
MCQ • 1 Mark
Section 2: General Biotechnology
Biomolecules, enzyme kinetics
Subtopic: Fundamentals of Biomolecules, enzyme kinetics
Question Statement:
Which one of the following is used for global alignment of two protein sequences?
Options:
-
(A) Chou-Fasman method
-
(B) Garnier-Osguthorpe-Robson (GOR) method
-
(C) Needleman-Wunsch algorithm
-
(D) Smith-Waterman algorithm
Step-by-Step Solution & Explanation
### **Official Solution & Concept Analysis (GATE BT 2023 Q.27)**
**1. Governing Concept**:
- **Topic**: Bioinformatics & Dynamic Programming Algorithms
- Sequence alignment algorithms:
- **Needleman-Wunsch algorithm**: Dynamic programming algorithm for **global alignment** of two sequences (aligns sequences along their entire end-to-end length).
- **Smith-Waterman algorithm**: Dynamic programming algorithm for **local alignment** (finds regions of highest local similarity).
- **Chou-Fasman & GOR**: Secondary structure prediction methods based on statistical propensities and information theory.
**2. Option Analysis**:
- **Option (A) [Chou-Fasman method] is INCORRECT**: Predicts secondary structure ($\alpha$-helix, $\beta$-sheet).
- **Option (B) [GOR method] is INCORRECT**: Information theory-based secondary structure prediction.
- **Option (C) [Needleman-Wunsch algorithm] is CORRECT**: Classical dynamic programming method for optimal global pairwise alignment.
- **Option (D) [Smith-Waterman algorithm] is INCORRECT**: Designed for local alignment, not global alignment.
**3. Final Answer**:
- **Correct Choice**: **C**
Practice This in Real CBT Exam Interface
Test yourself with the official TCS-iON palette, virtual calculator, and immediate performance analytics.
Launch CBT Mock Test