Bioinformatics Dynamic Programming Algorithm Sequence Alignment Online Exam Quiz
Bioinformatics Dynamic Programming Algorithm Sequence Alignment GK Quiz. Question and Answers related to Bioinformatics Dynamic Programming Algorithm Sequence Alignment. MCQ (Multiple Choice Questions with answers about Bioinformatics Dynamic Programming Algorithm Sequence Alignment
Which of the following is not a description of dynamic programming algorithm?
Options
A : A method of sequence alignment
B : A method that can take gaps into account
C : A method that requires a manageable number of comparisons
D : This method doesn’t provide an optimal (highest scoring) alignment
Which of the following is not a site on internet for alignment of sequence pairs?
Options
A : BLASTX
B : BLASTN
C : SIM
D : BCM Search Launcher
Gaps are added to the alignment because it ______
Options
A : increases the matching of identical amino acids at subsequent portions in the alignment
B : increases the matching of or dissimilar amino acids at subsequent portions in the alignment
C : reduces the overall score
D : enhances the area of the sequences
The matrices PAM250 and BLOSUM62 contain _______
Options
A : positive and negative values
B : positive values only
C : negative values only
D : neither positive nor negative values, just the percentage
Which of the following is untrue regarding dynamic programming algorithm?
Options
A : The method compares every pair of characters in the two sequences and generates an alignment
B : The output alignment will include matched and mismatched characters and gaps in the two sequences that are positioned so that the number of matches between identical or related characters is the maximum possible
C : The dynamic programming algorithm provides a reliable computational method for aligning DNA and protein sequences
D : This doesn’t allow making evolutionary predictions on the basis of sequence alignments
The higher is the score in the alignment _________
Options
A : the more significant is the alignment
B : or the less it resembles alignments in related proteins
C : the less significant is the alignment
D : the less it aligns with the related protein sequence
A feature of the dynamic programming algorithm is that the alignments obtained depend on the choice of a scoring system for comparing character pairs and penalty scores for gaps.
Options
A : True
B : False
C :
D :
Dayhoff PAM matrices, are based on an evolutionary model of protein change, whereas, BLOSUM matrices, are designed to identify members of the same family.
Options
A : True
B : False
C :
D :
Use of the dynamic programming method requires a scoring system for the comparison of symbol pairs, and a scheme for GAP penalties.
Options
A : True
B : False
C :
D :
After the derivation, the outputs of the dynamic programming are the ratios are called even scores.
Options
A : True
B : False
C :
D :
Chemical Engineering Basics - Part 1 more Online Exam Quiz
Bioinformatics Comparison Sage Dna Microarrays
Bioinformatics Conformational Flexibility
Bioinformatics Distance Based Methods
Bioinformatics Dna Genomic Sequencing
Bioinformatics Dot Matrix Sequence Comparison
Bioinformatics Evaluation Models Visualization Methods