If non-disjunction occurs in meiosis I, which of the following scenario is most likely to occur?

TLS Online TPP Program

#Question id: 14136

#Part-B Specialized Branches in 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

#Part-A Aptitude & General 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

#Part-B Specialized Branches in Biotechnology

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

#Part-A Aptitude & General Biotechnology

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: 14138

#Part-B Specialized Branches in Biotechnology

BLAST uses heuristics to align a query sequence with all sequences in a database. 

Reason(R): BLASTX uses protein sequences as queries to search against a protein sequence database.

TLS Online TPP Program

#Question id: 14138

#Part-A Aptitude & General Biotechnology

BLAST uses heuristics to align a query sequence with all sequences in a database. 

Reason(R): BLASTX uses protein sequences as queries to search against a protein sequence database.