TLS Online TPP Program

#Question id: 22712


Needleman-Wunsch algorithm, is an example of dynamic programming, which does not involve

#Unit 11. Bioinformatics
  1. scoring a matrix
  2. setting up a matrix
  3. local alignment
  4. identifying the optimal alignment