Practice Questions

  1. Home
  2. Free Resources
  3. Practice Questions
  4. 39482
TLS Online TPP Program

#Question id: 15698

Which of the following does not describe global alignment algorithm?

#I Life Science/ Life Sciences Group – I-V
  1. It attempts to align every residue in every sequence
  2. It is most useful when the aligning sequences are similar and of roughly the same size
  3. It is useful when the aligning sequences are divergent 
  4. It uses Needleman-Wunsch algorithm.
More Questions
TLS Online TPP Program

#Question id: 17920

#SCPH01 Biochemistry

C in CATH database stands for
TLS Online TPP Program

#Question id: 17920

#SCPH05 I Biotechnology

C in CATH database stands for
TLS Online TPP Program

#Question id: 17921

#SCPH01 Biochemistry

Which of the following scoring matrices is one of the best to score an alignment of highly conserved protein sequences?
TLS Online TPP Program

#Question id: 17921

#I Life Science/ Life Sciences Group – I-V

Which of the following scoring matrices is one of the best to score an alignment of highly conserved protein sequences?
TLS Online TPP Program

#Question id: 17921

#SCPH05 I Biotechnology

Which of the following scoring matrices is one of the best to score an alignment of highly conserved protein sequences?
TLS Online TPP Program

#Question id: 17922

#SCPH01 Biochemistry

Which of the following algorithms implements “once a gap, always a gap” policy?