TLS Online TPP Program

#Question id: 36199


Which of the following statements is/are correct about Dynamic programming for Local alignment ? 

#Section 7: Recombinant DNA technology and Other Tools in Biotechnology
  1. Local alignment focuses on identifying regions of similarity rather than aligning the full length of sequences.
  2. Suitable when sequences are divergent or have unequal lengths, or contain multiple domains of different origins.
  3. Algorithm: Smith–Waterman is the first dynamic programming method for local alignment.
  4. Needleman–Wunsch algorithm is used for this purpose.