TLS Online TPP Program

#Question id: 39891


Q. In bioinformatics, which of the following scenarios would be least suitable for using a Global Alignment algorithm (such as the Needleman-Wunsch algorithm)?

#Bio-Informatics
  1. Aligning two protein sequences that share a common ancestor and are nearly identical in length.
  2.  Identifying a highly conserved functional domain located in the middle of two otherwise unrelated, long DNA sequences.
  3. Comparing two alleles of the same gene to identify single nucleotide polymorphisms (SNPs).
  4. Mapping a 500bp sequence against another 510bp sequence where high similarity is expected throughout