The question asks for the method used for global alignment of two protein sequences. Global alignment aims to find the best possible alignment across the entire length of two sequences.
The Needleman-Wunsch algorithm is specifically designed for global sequence alignment. It computes an optimal global alignment score by comparing two sequences from beginning to end using dynamic programming.
Let's analyze why the other options are not suitable for global alignment:
Therefore, the Needleman-Wunsch algorithm is the correct choice for global alignment of two protein sequences.
To determine the viable cell count of a bacterial culture, you have plated $50 \mu \text{L}$ of a 100-fold diluted sample of the culture on a nutrient agar plate and obtained 20 colonies after overnight incubation. The viable cell count of the culture is ______ $\text{CFU mL}^{-1}$. (answer in integer)
| Bioinformatic tool/Database | Utility |
| P. BLAST | 1. Database for 3D protein structures |
| Q. Bowtie | 2. Tool to identify similarity of a query sequence to existing sequences available in databanks |
| R. AlphaFold | 3. Tool to align short read DNA sequences obtained from Next-generation sequencing to a reference genome |
| S. PDB | 4. AI tool to predict protein structures |