TLS Online TPP Program

#Question id: 4159


Which statement is not true about the ʺwobbleʺ position?

#SCPH06 I Botany
  1. It is in the 5ʹ position on the anticodon.

  2. Base pairing other than Watson-Crick base pairing is allowed at this position.

  3. It allows anticodons to recognize more than one codon.

  4. Often has inosinate at the 3ʹ position of the codon.

More Questions
TLS Online TPP Program

#Question id: 14136

#SCPH01 Biochemistry

Which of the following statement is incorrect about global alignment? 
(A) Global alignment is based on the Needleman–Wunsch algorithm.
(B) In Global alignment algorithm, an optimal alignment is obtained over the entire lengths of the two sequences.
(C) It is only suitable for aligning two closely related sequences that are of the same length.
(D) GAP is a web-based pairwise global alignment program.

TLS Online TPP Program

#Question id: 14136

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

Which of the following statement is incorrect about global alignment? 
(A) Global alignment is based on the Needleman–Wunsch algorithm.
(B) In Global alignment algorithm, an optimal alignment is obtained over the entire lengths of the two sequences.
(C) It is only suitable for aligning two closely related sequences that are of the same length.
(D) GAP is a web-based pairwise global alignment program.

TLS Online TPP Program

#Question id: 14136

#SCPH05 I Biotechnology

Which of the following statement is incorrect about global alignment? 
(A) Global alignment is based on the Needleman–Wunsch algorithm.
(B) In Global alignment algorithm, an optimal alignment is obtained over the entire lengths of the two sequences.
(C) It is only suitable for aligning two closely related sequences that are of the same length.
(D) GAP is a web-based pairwise global alignment program.

TLS Online TPP Program

#Question id: 14136

#SCPH05 I Biotechnology

Which of the following statement is incorrect about global alignment? 
(A) Global alignment is based on the Needleman–Wunsch algorithm.
(B) In Global alignment algorithm, an optimal alignment is obtained over the entire lengths of the two sequences.
(C) It is only suitable for aligning two closely related sequences that are of the same length.
(D) GAP is a web-based pairwise global alignment program.

TLS Online TPP Program

#Question id: 14137

#SCPH01 Biochemistry

Consider the following alignment of two DNA sequences:
                            AGTAAC
                            AA_ _AC

Assuming an affine gap scoring scheme of an identity matrix for substitution, a gap initiation penalty of 1 and a gap extension penalty of 0.1, the score of the alignment is _________

TLS Online TPP Program

#Question id: 14137

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

Consider the following alignment of two DNA sequences:
                            AGTAAC
                            AA_ _AC

Assuming an affine gap scoring scheme of an identity matrix for substitution, a gap initiation penalty of 1 and a gap extension penalty of 0.1, the score of the alignment is _________