Home > Bioinformatics > Quizzes > Bioinformatics Practice Test Questions: Sequence Alignment
Bioinformatics Practice Test Questions: Sequence Alignment
Fast practice, instant feedback. Timer auto-submits when time’s up.
Avg score: 61% Most missed: “The overall height of a logo position reflects how conserved the position is, an…”
In bioinformatics, sequence alignment is a way of arranging DNA, RNA, or protein sequences to identify regions of similarity. These similarities may be a result of functional, structural, or evolutionary relationships between the sequences. Topics include:  Protein Motifs and Domain Prediction, Motif and Domain Databases Using Regular Expressions, Motif and Domain Databases Using Statistical Models, Protein Family Databases, Global Sequence Alignment, Local Sequence Alignment, Motif Discovery in Unaligned Sequences, Dot Matrix Sequence Comparison, Dynamic Programming Algorithm for Sequence... Show more
Bioinformatics Practice Test Questions: Sequence Alignment
Time left 00:00
25 Questions

1. Which of the following statements about PANTHER and TIGRFAMs databases is incorrect regarding its features?
2. Which of the following is true regarding the assumptions in the method of constructing the Dayhoff scoring matrix?
3. Among the following which one is not the approach to the local alignment?
4. Which of the following is not a disadvantage of Needleman-Wunsch algorithm?
5. Which of the following doesn’t describe PAM matrices?
6. Which of the following is false in case of the database SMART and its algorithm?
7. When random or unrelated sequences are compared using a global alignment method, they can have ____________ reflecting the tendency of the global algorithm to match as many characters as possible.
8. Which of the following does not describe k-tuple methods?
9. What is the source of protein structures in SCOP and CATH?
10. Which of the following does not describe global alignment algorithm?
11. 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.
12. _______ analyzed the distribution of scores among 100 vertebrate nucleic acid sequences and compared these scores with randomized sequences prepared in different ways.
13. Which of the following statements about SUPERFAMILY database is incorrect regarding its features?
14. On analysis of the alignment scores of random sequences will reveal that the scores follow a different distribution than the normal distribution called the _________
15. The higher is the score in the alignment _________
16. After the derivation, the outputs of the dynamic programming are the ratios are called even scores.
17. Isolated dots that are not on the diagonal represent exact matches.
18. Which of the following is true for EMBOSS Dottup?
19. Which of the following does not describe global alignment algorithm?
20. When was this method, first described?
21. A length and distance that gives the highest overall probability may then be determined. Such alignments are initially found using ________
22. In Bayesian methods, difficulty with making estimations is that the estimate depends on the following Assumption. (Assumption – The mutation rate in sequences has been constant with time and that the rate of mutation of all nucleotides is the same.)
23. Which of the following statements about COG is incorrect regarding its features?
24. Which of the following does not describe local alignment?
25. Point out the wrong or irrelevant mathematical method in motif analysis.

⚡ Recently practiced quizzes in this topic
Live quiz activity