logo
  • Home
  • Test & Rank
  • About
  • Training
  • Programming
  • CS
  • IT
  • IS
  • ECE
  • EEE
  • EE
  • Civil
  • Mechanical
  • Chemical
  • Metallurgy
  • Instrumentation
  • Aeronautical
  • Aerospace
  • Biotechnology
  • Mining
  • Marine
  • Agriculture
  • MCA
  • BCA
  • Internship
  • Jobs
  • Contact

Bioinformatics Multiple Choice Questions | MCQs | Quiz

Bioinformatics Interview Questions and Answers
Practice Bioinformatics questions and answers for interviews, campus placements, online tests, aptitude tests, quizzes and competitive exams.

Get Started

•   Protein Motifs
•   ↓ Motif Databases ↓
•   Regular Expressions
•   Statistical Models
•   Protein Family Databases
•   Global Sequence Alignment
•   Local Sequence Alignment
•   Motif Discovery-Sequences
•   Dot Matrix Sequence
•   Dynamic Programming
•   Scoring Matrices & Penalty
•   Alignments Assessing
•   Bayesian Statistics
•   Sequence Homology
•   Methods
•   Sequence Alignment
•   Exhaustive Algorithms
•   Heuristic Algorithms
•   Needleman - Wunsch
•   Progressive Methods
•   Iterative Methods
•   Localized Alignments
•   Aiding Alignment
•   Specific Scoring Matrices
•   Heuristic Database Search
•   BLAST
•   FASTA
•   Compare FASTA & BLAST
•   Smith - Waterman Method
•   ↓ Protein Structure ↓
•   Protein Structure Basics
•   Visualization
•   Comparison
•   Classification
•   Globular Proteins
•   Transmembrane Proteins
•   Coiled Coil Prediction
•   Homology Modeling
•   Threading Recognition
•   RNA Structures Types
•   RNA Prediction Methods
•   Ab Initio Approach
•   Comparative Approach
•   Performance Evaluation
•   Prediction Limitations
•   Stochastic Context
•   MFOLD & Energy Plots
•   RNA Genomes
•   Genome Mapping
•   Genome Sequencing
•   Genome Assembly
•   Genome Annotation
•   Comparative Genomics
•   Sequence Approaches
•   Microarray Approaches
•   SAGE & DNA Microarrays
•   Protein Expressions
•   Translational Modification
•   Protein Sorting
•   Protein Interactions
•   Phylogenetics Basics
•   Gene Vs Specie Phylogeny
•   Tree Representation Forms
•   Distance Based Methods
•   Character Based Methods
•   Phylogenetic Evaluation
•   Phylogenetic Programs
•   Parsimony Method
•   Likelihood Approach
•   Phylogenetic Predictions
•   Gene Prediction Programs
•   Prokaryote Gene Prediction
•   Eukaryotes Prediction - 1
•   Eukaryotes Prediction - 2
•   Prokaryotes & Eukaryotes
•   Prediction Algorithms - 1
•   Prediction Algorithms - 2
•   Prediction Algorithms - 3
•   Molecular Complementarity
•   Conformational Flexibility
•   Visualization Methods
•   Protein Interactions
•   Domain Interactions
•   Gene Order & Phylogeny
•   DNA Sequencing
•   Sequencing cDNA Libraries
•   Sequence Formats
•   Multiple Sequence Formats
•   Database Access Program
•   Genome Anatomy - 1
•   Genome Anatomy - 2
•   Genome Anatomy - 3
•   Gene Identification - 1
•   Gene Identification - 2
•   Gene Identification - 3
•   Comparative Genomics - 1
•   Comparative Genomics - 2
•   Genes Classification
•   Global Gene Regulation
•   Gene Function Prediction

Best Reference Books

Bioinformatics Books
« Prev Page
Next Page »

Bioinformatics Questions and Answers – Position – Specific Scoring Matrices

Posted on February 11, 2018 by Manish

This set of Bioinformatics Multiple Choice Questions & Answers (MCQs) focuses on “Position – Specific Scoring Matrices”.

1. Analysis of s for conserved blocks of sequence leads to production of the position-specific scoring matrix.
a) True
b) False
View Answer

Answer: a
Explanation: The analysis of MSAs (Multiple Sequence Alignment) for conserved blocks of sequence leads to production of the position-specific scoring matrix, or PSSM. The PSSM may be used to search a sequence to obtain the most probable location or locations of the motif represented by the PSSM. Alternatively, the PSSM may be used to search an entire database to identify additional sequences that also have the same motif.
advertisement

2. The quality and quantity of information provided by the PSSM also varies for ________ in the motif.
a) each row
b) each column
c) rows and columns
d) neither the rows nor the columns
View Answer

Answer: b
Explanation: The quality and quantity of information provided by the PSSM also varies for each column in the motif, and this variation profoundly influences the matches found with sequences. This situation can be accurately described by information theory, and the results can be displayed by a colored graph called a sequence logo.

3. Two considerations arise in trying to tune the PSSM so that it adequately represents the training sequences. Which of the following is not their description?
a) If a given column in 20 sequences has only isoleucine, it is not very likely that a different amino acid will be found in other sequences with that motif because the residue is probably important for function
b) If a given column in 20 sequences has only isoleucine, it is very likely that a different amino acid will be found in other sequences with that motif because the residue is probably important for function
c) If the number of sequences with the found motif is large and reasonably diverse, the sequences represent a good statistical sampling of all sequences that are ever likely to be found with that same motif
d) Another column in the motif from the 20 sequences may have several amino acids, and some amino acids may not be represented at all
View Answer

Answer: b
Explanation: The PSSM is constructed by a simple logarithmic transformation of a matrix giving the frequency of each amino acid in the motif. Even more variation may be expected at that position in other sequences, although the more abundant amino acids already found in that column would probably be favored.

4. If a good sampling of sequences is _______ the number of sequences is _________ and the motif structure is ________ it should, in principle, be possible to obtain frequencies highly representative of the same motif in other sequences also.
a) available, sufficiently large, not too complex
b) unavailable, sufficiently large, not too complex
c) unavailable, sufficiently small, not too complex
d) available, sufficiently large, too complex
View Answer

Answer: a
Explanation: the more abundant amino acids already found in that column would probably be favored. Thus, if a good sampling of sequences is available, the number of sequences is sufficiently large, and the motif structure is not too complex, it should, in principle, be possible to obtain frequencies highly representative of the same motif in other sequences also (Henikoff and Henikoff 1996).
advertisement

5. If the data set is _______, then unless the motif has __________ amino acids in each column, the column frequencies in the motif may not be highly representative of all other occurrences of the motif.
a) small, distinct
b) small, almost identical
c) large, almost identical
d) large, distinct
View Answer

Answer: b
Explanation: the number of sequences for producing the motif may be small, highly diverse, or complex, giving rise to a second level of consideration. If the data set is small, then unless the motif has almost identical amino acids in each column, the column frequencies in the motif may not be highly representative of all other occurrences of the motif. In such cases, it is desirable to improve the estimates of the amino acid frequencies by adding extra amino acid counts, called pseudocounts, to obtain a more reasonable distribution of amino acid frequencies in the column.

6. Even if many pseudocounts are added in comparison to real sequence counts, the amino acid frequencies will not have any effect or influence.
a) True
b) False
View Answer

Answer: b
Explanation: Knowing how many counts to add is a difficult but fortunately solvable problem. On the one hand, if too many pseudocounts are added in comparison to real sequence counts, the pseudocounts will become the dominant influence in the amino acid frequencies and searches using the motif will not work. On the other hand, if there are relatively few real counts, many amino acid variations may not be present because of the small sample of sequences.

7. Which of the following is not a feature of editors and formatters?
a) provision for displaying the sequence on a color monitor with residue colors to aid in a clear visual representation of the alignment
b) recognition of the multiple sequence format that was output by the MSA (Multiple Sequence Alignment) program
c) maintenance of the alignment in a suitable format when the editing is completed
d) disallowing shading conserved residues in the alignment
View Answer

Answer: d
Explanation: In addition to this, provision of a suitable windows interface, allowing use of the mouse to add, delete, or move sequence followed by an updated display of the alignment, is a feature. In addition, there are other types of editing that are commonly performed on MSAs (Multiple Sequence Alignment) program such as, for example, shading conserved residues in the alignment.
advertisement

8. GDE (Genetic Data Environment) provides a general interface on UNIX machines for sequence analysis, sequence alignment editing, and display.
a) True
b) False
View Answer

Answer: a
Explanation: It is available from several anonymous FTP sites. This interface requires communication with a host UNIX machine running the Genetics Computer Group software. Interface with MS-DOS or Macintosh is possible if the computer is equipped with the appropriate X-Windows client software.

9. MACAW is a local multiple sequence alignment program only.
a) True
b) False
View Answer

Answer: b
Explanation: MACAW is both a local multiple sequence alignment program and a sequence editing tool. Given a set of sequences, the program finds ungapped blocks in the sequences and gives their statistical significance. Later versions of the program find blocks by one of three user-chosen methods.

10. Two commonly encountered examples are the Genetics Computer Group’s MSF format and the CLUSTALW ALN format.
a) True
b) False
View Answer

Answer: a
Explanation: This is because these formats follow a precise outline, one may be readily converted to another by computer programs. READSEQ by D.G.Gilbert at Indiana University at Bloomington is one such program.
Sanfoundry Global Education & Learning Series – Bioinformatics.

To practice all areas of Bioinformatics, here is complete set of 1000+ Multiple Choice Questions and Answers.

« Prev Page - Bioinformatics Questions and Answers – Statistical Methods for Aiding Alignment
» Next Page - Bioinformatics Questions and Answers – Heuristic Database Searching

« Bioinformatics Questions and Answers – Statistical Methods for Aiding Alignment
Bioinformatics Questions and Answers – Heuristic Database Searching »
advertisement

Deep Dive @ Sanfoundry:

  1. Java Programming Examples on Combinatorial Problems & Algorithms
  2. C# Programming Examples on Matrix
  3. C Programming Examples on Matrix
  4. C++ Questions and Answers
  5. C++ Programming Examples on Set & String Problems & Algorithms
  6. C Programming Examples on Combinatorial Problems & Algorithms
  7. Unit Processes Questions and Answers
  8. C Programming Examples on Set & String Problems & Algorithms
  9. Biochemistry Questions and Answers
  10. Bioinformatics Questions and Answers
Manish Bhojasia, a technology veteran with 20+ years @ Cisco & Wipro, is Founder and CTO at Sanfoundry. He is Linux Kernel Developer and SAN Architect and is passionate about competency developments in these areas. He lives in Bangalore and delivers focused training sessions to IT professionals in Linux Kernel, Linux Debugging, Linux Device Drivers, Linux Networking, Linux Storage & Cluster Administration, Advanced C Programming, SAN Storage Technologies, SCSI Internals and Storage Protocols such as iSCSI & Fiber Channel. Stay connected with him below:
LinkedIn | Facebook | Twitter | Google+

Best Careers

Developer Tracks
SAN Developer
Linux Kernel Developer
Linux Driver Developer
Linux Network Developer

Live Training Photos
Mentoring
Software Productivity
GDB Assignment
Sanfoundry is No. 1 choice for Deep Hands-ON Trainings in SAN, Linux & C, Kernel Programming. Our Founder has trained employees of almost all Top Companies in India such as VMware, Citrix, Oracle, Motorola, Ericsson, Aricent, HP, Intuit, Microsoft, Cisco, SAP Labs, Siemens, Symantec, Redhat, Chelsio, Cavium, ST-Micro, Samsung, LG-Soft, Wipro, TCS, HCL, IBM, Accenture, HSBC, Mphasis, Tata-Elxsi, Tata VSNL, Mindtree, Cognizant and Startups.

Best Trainings

SAN I - Technology
SAN II - Admin
Linux Fundamentals
Advanced C Training
Linux-C Debugging
System Programming
Network Programming
Linux Threads
Kernel Programming
Kernel Debugging
Linux Device Drivers

Best Reference Books

Computer Science Books
Algorithm & Programming Books
Electronics Engineering Books
Electrical Engineering Books
Chemical Engineering Books
Civil Engineering Books
Mechanical Engineering Books
Industrial Engineering Books
Instrumentation Engg Books
Metallurgical Engineering Books
All Stream Best Books

Questions and Answers

1000 C Questions & Answers
1000 C++ Questions & Answers
1000 C# Questions & Answers
1000 Java Questions & Answers
1000 Linux Questions & Answers
1000 Python Questions
1000 PHP Questions & Answers
1000 Hadoop Questions
Cloud Computing Questions
Computer Science Questions
All Stream Questions & Answers

India Internships

Computer Science Internships
Instrumentation Internships
Electronics Internships
Electrical Internships
Mechanical Internships
Industrial Internships
Systems Internships
Chemical Internships
Civil Internships
IT Internships
All Stream Internships

About Sanfoundry

About Us
Copyright
Terms
Privacy Policy
Jobs
Bangalore Training
Online Training
Developers Track
Mentoring Sessions
Contact Us
Sitemap
© 2011 Sanfoundry. All Rights Reserved.