Which of the following is not true about iterative methods?

Genetic Algorithm is method used for under this

Hidden Markov Models are used for Multiple Sequence Alignment

The objective is to improve the overall alignment score

MultAlin recalculates global scores

Which of the following is incorrect regarding PRRP?

The whole process is repeated until there is no further increase in the alignment score

The program PRRP uses iterative methods to produce an alignment

An initial pair-wise alignment is made to predict a tree

The whole process is repeated until there is no further increase in the alignment score

Explore topic-wise MCQs in Bioinformatics.

This section includes 10 Mcqs, each offering curated multiple-choice questions to sharpen your Bioinformatics knowledge and support exam preparation. Choose a topic below to get started.

1.	Which of the following is not true about iterative methods?
A.	Genetic Algorithm is method used for under this
B.	Hidden Markov Models are used for Multiple Sequence Alignment
C.	The objective is to improve the overall alignment score
D.	MultAlin recalculates global scores
Answer» E.

Discussion

2.	The HMM is a statistical model that considers few combinations of matches and gaps to generate an alignment of a set of sequences.
A.	True
B.	False
Answer» C.

Discussion

3.	In Genetic Algorithm, in the mutation process _______
A.	sequence is changed
B.	gaps are not inserted
C.	sequence is not changed
D.	gaps are not rearranged
Answer» D. gaps are not rearranged

Discussion

4.	The second step in the Genetic Algorithm comprises of scoring of the 100 initial MSAs by the sum of pairs method.
A.	True
B.	False
Answer» B. False

Discussion

5.	The first step in Genetic Algorithm is arranging the sequences to be aligned in rows.
A.	True
B.	False
Answer» B. False

Discussion

6.	An approach for obtaining a higher-scoring MSA (Multiple Sequence Alignment) by rearranging an existing alignment uses a probability approach called simulated annealing.
A.	True
B.	False
Answer» B. False

Discussion

7.	The Genetic Algorithm method has been recently adapted for MSA(Multiple Sequence Alignment) by Corpet (1998).
A.	True
B.	False
Answer» C.

Discussion

8.	In the program DIALIGN, pairs of sequences are aligned to locate aligned regions that do not include gaps, much like continuous diagonals in a dot matrix plot.
A.	True
B.	False
Answer» B. False

Discussion

9.	Which of the following is incorrect regarding PRRP?
A.	The program PRRP uses iterative methods to produce an alignment
B.	An initial pair-wise alignment is made to predict a tree
C.	Only one cycle is performed
D.	The whole process is repeated until there is no further increase in the alignment score
Answer» D. The whole process is repeated until there is no further increase in the alignment score

Discussion

10.	Iterative methods include repeatedly realigning subgroups of the sequences and then by aligning these subgroups into a local alignment of all of the sequences.
A.	True
B.	False
Answer» C.

Discussion

Explore topic-wise MCQs in Bioinformatics.

Which of the following is not true about iterative methods?

The HMM is a statistical model that considers few combinations of matches and gaps to generate an alignment of a set of sequences.

In Genetic Algorithm, in the mutation process _______

The second step in the Genetic Algorithm comprises of scoring of the 100 initial MSAs by the sum of pairs method.

The first step in Genetic Algorithm is arranging the sequences to be aligned in rows.

An approach for obtaining a higher-scoring MSA (Multiple Sequence Alignment) by rearranging an existing alignment uses a probability approach called simulated annealing.

The Genetic Algorithm method has been recently adapted for MSA(Multiple Sequence Alignment) by Corpet (1998).

In the program DIALIGN, pairs of sequences are aligned to locate aligned regions that do not include gaps, much like continuous diagonals in a dot matrix plot.

Which of the following is incorrect regarding PRRP?

Iterative methods include repeatedly realigning subgroups of the sequences and then by aligning these subgroups into a local alignment of all of the sequences.