Generic selectors
Exact matches only
Search in title
Search in content
Search in posts
Search in pages
Filter by Categories
nmims post
Objective Type Set
Online MCQ Assignment
Question Solution
Solved Question
Uncategorized

Multiple choice question for engineering

Set 1

1. Which of the given statements is incorrect about global gene regulation?
a) One way to obtain useful information about a genome is to determine which genes are induced or repressed in response to a phase of the cell cycle
b) Sets of a gene whose expression rises and falls under the same condition are likely to have a related function
c) Sets of a gene whose expression rises and falls under the same condition are likely to have dissimilar functions
d) Cell cycle is a developmental phase, or a response to the environment

View Answer

Answer: c [Reason:] In addition, a pattern of gene expression may also be an indicator of abnormal cellular regulation and is a useful tool in cancer diagnosis. Because genomes, especially eukaryotic genomes, are so large, a new technology has been developed for studying the regulation of thousands of genes on a microscope slide.

2. Which of the given statements is incorrect about Microarray (or microchip) analysis?
a) It is a new technology in which all of the genes of an organism are represented by oligonucleotide sequences spread out in an 80 x 80 array on microscope slides
b) The oligonucleotide sequences cannot be synthesized directly on the slide
c) The oligonucleotides are collectively hybridized to a labeled cDNA library prepared by reverse-transcribing mRNA from cells
d) The amount of label binding to each oligonucleotide spot reflects the amount of mRNA in the cell

View Answer

Answer: b [Reason:] The oligonucleotide sequences can also be synthesized directly on the slide at densities of up to one million per square centimeter. Genes that are responding the same way to an environmental signal, in this case the addition of serum to serum-starved skin cells are clustered together in a display. From this analysis, a set of genes that responds in an identical manner may be identified.

3. Once a set of genes that are co-regulated has been found, the promoter regions of these genes may be analyzed for conserved patterns that represent sites of interaction with specific transcription factors.
a) True
b) False

View Answer

Answer: a [Reason:] Automatic methods for clustering related sets of genes have been devised. The first of these methods, hierarchical clustering, is commonly used, but the other two methods are better designed to detect differences in patterns over a set of time points or samples.

4. Which of the given statements is incorrect about Microarray Analysis?
a) It is designed to detect global changes in transcription in a genome
b) It provides information about the levels of protein products of the genes
c) The proteins are first separated in a column on the basis of size and then across a second dimension on a slab on the basis of charge
d) Labeled protein samples may also be extracted from treated cells and separated by two-dimensional gel electrophoresis

View Answer

Answer: b [Reason:] Microarray analysis is designed to detect global changes in transcription in a genome but does not provide information about the levels of protein products of the genes, which may also be subject to translational regulation. This method also can resolve thousands of proteins based on size and charge. There are databases of the patterns found in different organisms.

5. In cluster analysis of microarray data– If Xi is the log odds value for gene X at time i, then for two genes X and Y and N observations, a similarity score is calculated. S(X,Y) is also known as the Pearson correlation coefficent. Xoffset and Yoffset can be the mean of the observations on X or Y, respectively, in which case is the standard deviation, or else Xoffset and Yoffset can be set to zero when a reference state is used.Which of the following best represents it?
bioinformatics-questions-answers-global-gene-regulation-q5

View Answer

Answer: b [Reason:] After values of S(X,Y) have been calculated for all gene combinations, the most closely related pairs are identified in an above-diagonal scoring matrix. The object of clustering is to identify genes that respond the same way to the environmental treatment. Each gene is compared to every other gene and a gene similarity score (metric) is produced.

6. In cluster analysis of microarray data– A node is created between the _____ scoring pair, and the gene expressed profiles of these two genes are averaged and the joined elements are weighted by the _____ of elements they contain.
a) lowest, frequency
b) average, sequence
c) lowest, number
d) highest, number

View Answer

Answer: d [Reason:] The node is created as mentioned. The matrix is then updated replacing the two joined elements by the node.

7. In cluster analysis of microarray data– For n genes, the process is repeated ____ times until a single element remains.
a) n2
b) n
c) n-1
d) n-4

View Answer

Answer: c [Reason:] This number of iterations gives the best results. In the final dendrogram, the order of genes within a cluster is determined by simple weighting schemes, e.g., average dendrogram level.

8. The hierarchical clustering method generates a similarity score [S(X,Y)] for all gene combinations, places the scores in a matrix, joins those genes that have the highest score, and then continues to join progressively less similar pairs.
a) True
b) False

View Answer

Answer: a [Reason:] The disadvantage of this method is that it fails to discriminate between different patterns of variation. For example, a gene expression pattern for which a high value is found at an intermediate time point will be clustered with another for which a high value is found at a late time point in the experiment. These variations have to be separated in a subsequent step.

9. In Self-organizing maps a choice is made of a number of clusters by which to organize the data.
a) True
b) False

View Answer

Answer: a [Reason:] The object is to move each node to the center of a cluster of data points. At each iteration a data point P is selected, and the node closest to that point is identified.

10. SVMs (Support vector machines) are a binary classification method to discriminate one set of data points from another
a) True
b) False

View Answer

Answer: a [Reason:] They are similar to the types of discriminant analyses. For microarray analysis, sets of genes are identified that represent a target pattern of gene expression.

11. In SVMs (Support vector machines) Data points are log-transformed and normalized as in method A, where for N observations of a gene i, the log transform Xi of the expression level Ei and reference level Ri is _____
bioinformatics-questions-answers-global-gene-regulation-q11

View Answer

Answer: a [Reason:] SVMs were used to categorize genes based on 79 different sets of data points from studies of the yeast cell cycle and are particularly useful for such complex data sets. Gene combinations averaged over all experimental conditions are then examined by a multidimensional analysis.

Set 2

1. When did Needleman-Wunsch first describe the algorithm for global alignment?
a) 1899
b) 1970
c) 1930
d) 1950

View Answer

Answer: b [Reason:] Needleman and Wunsch were among the first to describe dynamic programming algorithm for global sequence. In global sequence alignment, an attempt to align the entirety of two different sequences is made, up to and including the ends of sequences.

2. Which of the following does not describe dynamic programming?
a) The approach compares every pair of characters in the two sequences and generates an alignment, which is the best or optimal
b) Global alignment algorithm is based on this method
c) Local alignment algorithm is based on this method
d) The method can be useful in aligning protein sequences to protein sequences only

View Answer

Answer: d [Reason:] The method can be useful in aligning nucleotide to protein sequences as well. These programs first perform pair-wise alignment on each pair of sequences. Then, they perform local re-arrangements on these results, in order to optimize overlaps between multiple sequences.

3. Which of the following is not an advantage of Needleman-Wunsch algorithm?
a) New algorithmic improvements as well as increasing computer capacity make possible to align a query sequence against a large DB in a few minutes
b) Similar sequence region is of same order and orientation
c) This does not help in determining evolutionary relationship
d) If you have 2 genes that are already understood as closely related, then this type of algorithm can be used to understand them in further details

View Answer

Answer: c [Reason:] Needleman-Wunsch algorithm is used when 2 genes that are already understood as closely related and can be used to understand them in further details. This is quite helpful in finding orthologs, paralogs and homologs in evolutionary studies.

4. Which of the following is not a disadvantage of Needleman-Wunsch algorithm?
a) This method is comparatively slow
b) There is a need of intensive memory
c) This cannot be applied on genome sized sequences
d) This method can be applied to even large sized sequences

View Answer

Answer: d [Reason:] This method cannot be applied on genome sized sequences. But this is indeed useful in determining similarities and evolutionary relationships.

5. Which of the following does not describe global alignment algorithm?
a) In initialization step, the first row and first column are subject to gap penalty
b) Score can be negative
c) In trace back step, beginning is with the cell at the lower right of the matrix and it ends at top left cell
d) First row and first column are set to zero

View Answer

Answer: d [Reason:] Initialization and scoring system of the Smith–Waterman algorithm and Needleman-Wunsch algorithm is quite different. In global alignment first row and first column are subject to gap penalty and are not set to 0.

6. Which of the following does not describe PAM matrices?
a) These matrices are used in optimal alignment scoring
b) It stands for Point Altered Mutations
c) It stands for Point Accepted Mutations
d) It was first developed by Margaret Dayhoff

View Answer

Answer: b [Reason:] PAM stands for Point Accepted Mutations. PAM matrices are calculated by observing the differences in closely related proteins. One PAM unit (PAM1) specifies one accepted point mutation per 100 amino acid residues, i.e. 1% change and 99% remains as such.

7. Which of the following is untrue regarding the scoring system used in dynamic programming?
a) If the residues are same in both the sequences the match score is assumed as +5 which is added to the diagonally positioned cell of the current cell
b) If the residues are not same, the mismatch score is assumed as -3
c) If the residues are not same, the mismatch score is assumed as 3
d) The score should be added to the diagonally positioned cell of the current cell

View Answer

Answer: c [Reason:] If the residues are not same, the mismatch score is assumed as -3 and it has to be negative. However, these scores are not unique, they can be user defined also, but the mismatch and gap penalty should be the negative values.

8. Which of the following does not describe global alignment algorithm?
a) Score can be negative in this method
b) It is based on dynamic programming technique
c) For two sequences of length m and n, the matrix to be defined should be of dimensions m+1 and n+1
d) For two sequences of length m and n, the matrix to be defined should be of dimensions m and n

View Answer

Answer: d [Reason:] For two sequences of length m and n, the matrix to be defined should be of dimensions m+1 and n+1so that there is margin for addition of the score along the diagonal. Also, corresponding score is further calculated at the end cumulatively.

9. Which of the following does not describe global alignment algorithm?
a) It attempts to align every residue in every sequence
b) It is most useful when the aligning sequences are similar and of roughly the same size
c) It is useful when the aligning sequences are dissimilar
d) It can use Needleman-Wunsch algorithm

View Answer

Answer: c [Reason:] Performing global alignment is most useful when the aligning sequences are similar and of roughly the same size. This is most useful to find the similarities among the organisms that are roughly connected on the timeline.

10. Which of the following is wrong in case of substitution matrices?
a) They determine likelihood of homology between two sequences
b) They use system where substitutions that are more likely should get a higher score
c) They use system where substitutions that are less likely should get a lower score
d) BLOSUM-X type uses logarithmic identity to find similarity

View Answer

Answer: d [Reason:] BLOSUM-X type identifies sequences that are X% similar to the query sequence i. e. score 54 corresponds to 54% similarity hence reducing the complexity of the output and giving the similarity in percentage. Also, these matrices are popular in bioinformatics due to their speed and accuracy.

Set 3

1. Which of the following is untrue regarding Progressive Alignment Method?
a) Progressive alignment depends on the stepwise assembly of multiple alignment and is heuristic in nature
b) It speeds up the alignment of multiple sequences through a multistep process
c) It first conducts pair wise alignments for each possible pair of sequences using the Needleman–Wunsch global alignment method and records these similarity scores from the pair wise comparisons
d) Its drawback is it slows down the alignment of multiple sequences through a single step process

View Answer

Answer: d [Reason:] Progressive alignment speeds up the alignment of multiple sequences through a multistep process further, the scores can either be percent identity or similarity scores based on a particular substitution matrix. Both scores correlate with the evolutionary distances between sequences.

2. Clustal is a progressive multiple alignment program available either as a stand-alone or on-line program.
a) True
b) False

View Answer

Answer: a [Reason:] Probably the most well-known progressive alignment program is Clustal. The stand-alone program, which runs on UNIX and Macintosh, has two variants, Clustal W and Clustal X. The W version provides a simple text-based interface and the X version provides a more user-friendly graphical interface.

3. Which of the following is untrue regarding the progressive alignment method?
a) The program also applies a weighting scheme to increase the reliability of aligning divergent sequences (sequences with less than 25% identity)
b) The progress is done by down weighting redundant and closely related groups of sequences in the alignment by a certain factor
c) This scheme is useful in enhancing similar sequences from dominating the alignment
d) This scheme is useful in enhancing similar sequences from dominating the alignment

View Answer

Answer: c [Reason:] This scheme is useful in enhancing similar sequences from dominating the alignment. Further, the weight factor for each sequence is determined by its branch length on the guide tree. The branch lengths are normalized by how many times sequences share a basal branch from the root of the tree.

4. Which of the following is not a drawback of the progressive alignment method?
a) The progressive alignment method is not suitable for comparing sequences of different lengths because it is a global alignment–based method
b) In this method the use of affine gap penalties, long gaps are not allowed, and, in some cases, this may limit the accuracy of the method
c) In this method the use of affine gap penalties, long gaps is allowed, and, in some cases, this may limit the accuracy of the method
d) The final alignment result is also influenced by the order of sequence addition

View Answer

Answer: c [Reason:] Another major limitation is the “greedy” nature of the algorithm: it depends on initial pair wise alignment. Once gaps introduced in the early steps of alignment, they are fixed. The final alignment could be far from optimal. The problem can be more glaring when dealing with divergent sequences.

5. Which of the following is untrue regarding T-Coffee?
a) It stands for Tree-based Consistency Objective Function for alignment Evaluation
b) It performs progressive sequence alignments as in Clustal.
c) The global pair wise alignment is not performed using the Clustal program.
d) The local pair wise alignment is generated by the Lalign program, from which the top ten scored alignments are selected

View Answer

: c [Reason:] The global pair wise alignment is performed using the Clustal program. The main difference is that, in processing a query, T-Coffee performs both global and local pair wise alignment for all possible pairs involved. The collection of local and global sequence alignments is pooled to form a library. The consistency of the alignments is evaluated.

6. Which of the following is untrue about iterative approach?
a) The iterative approach is based on the idea that an optimal solution can be found by repeatedly modifying existing suboptimal solutions
b) Because the order of the sequences used for alignment is different in each iteration
c) This method is also heuristic in nature and does not have guarantees for finding the optimal alignment
d) This method is not based on heuristic methods

View Answer

Answer: d [Reason:] This method is based on heuristic methods. The procedure starts by producing a low-quality alignment and gradually improves it by iterative realignment through well-defined procedures until no more improvements in the alignment scores can be achieved.

7. Which of the following is untrue about PRRN?
a) PRRN is a web-based program that uses a double nested iterative strategy for multiple alignment
b) It performs multiple alignments through two sets of iterations: inner iteration and outer iteration
c) In the outer iteration, an initial random alignment is generated that is used to derive a UPGMA tree
d) In the inner iteration, the sequences are randomly divided into multiple groups

View Answer

Answer: d [Reason:] In the inner iteration, the sequences are randomly divided into two groups. Randomized alignment is used for each group in the initial cycle, after which the alignment positions in each group are fixed. The two groups, each treated as a single sequence, are then aligned to each other using global dynamic programming. The process is repeated through many cycles until the total SP score no longer increases. At this point, the resulting alignment is used to construct a new UPGMA tree.

8. The major drawback of the progressive and iterative alignment strategies is that they are largely global alignment based and may therefore fail to recognize conserved domains and motifs among highly divergent sequences of varying lengths.
a) True
b) False

View Answer

Answer: a [Reason:] For such divergent sequences that share only regional similarities, a local alignment based approach has to be used. The strategy identifies a block of ungapped alignment shared by all the sequences, hence, the block-based local alignment strategy.

9. Which of the following is untrue about DIALIGN2?
a) It is a web based program designed to detect local similarities
b) It is designed to detect global similarities
c) It does not apply gap penalties and thus is not sensitive to long gaps
d) The method breaks each of the sequences down to smaller segments and performs all possible pair wise alignments between the segments

View Answer

Answer: b [Reason:] High-scoring segments, called blocks, among different sequences are then compiled in a progressive manner to assemble a full multiple alignment. It places emphasis on block-to-block comparison rather than residue-to-residue comparison. The sequence regions between the blocks are left unaligned. The program has been shown to be especially suitable for aligning divergent sequences with only local similarity.

10. Match-Box compares segments of some of the nine residues of possible Pair wise alignments.
a) True
b) False

View Answer

Answer: b [Reason:] Match-Box compares segments of every nine residues of all possible pair wise alignments. It is a web-based server that also aims to identify conserved blocks (or boxes) among sequences. The program compares segments of every nine residues of all possible pair wise alignments. If the similarity of particular segments is above a certain threshold across all sequences, they are used as an anchor to assemble multiple alignments; residues between blocks are unaligned.

Set 4

1. Which of the following is incorrect about the RNA structure prediction?
a) Given the sequence, it provides an ab initio prediction of secondary structure
b) From the many possible choices of complementary sequences that can potentially base-pair, the compatible sets that provide the highest energy molecules are chosen
c) Structures with energies almost as stable as the most stable one may also be produced
d) Regions whose predictions are the most reliable can be identified from such an analysis

View Answer

Answer: b [Reason:] Stable structures are the ones with least or relatively quite low energy. Sequence variations found in related sequences may also be used to predict which base pairs are likely to be found in each of the molecules. One variation of RNA structure prediction methods will predict a set of sequences that are able to form a particular structure.

2. A type of RNA secondary structure prediction method takes into account conserved patterns of base-pairing that are conserved during evolution of a given class of RNA molecules.
a) True
b) False

View Answer

Answer: a [Reason:] Sequence positions that base-pair are found to vary at the same time during evolution of RNA molecules so that structural integrity is maintained. For example, if two positions G and C form a base pair in a given type of molecule, then sequences that have C and G reversed, or A and U or U and A at the corresponding positions, would be considered reasonable matches.

3. RNA secondary structure is composed primarily of triple-stranded RNA regions formed by folding the single-stranded molecule back twice on itself.
a) True
b) False

View Answer

Answer: b [Reason:] RNA secondary structure is composed primarily of double-stranded RNA regions formed by folding the single-stranded molecule back on itself. To produce such double-stranded regions, a run of bases downstream in the RNA sequence must be complementary to another upstream run so that Watson–Crick base-pairing between the complementary nucleotides G/C and A/U (analogous to the G/C and A/T base pairs in DNA) can occur.

4. ____ wobble pairs may be produced in these double-stranded regions.
a) A/A
b) A/U
c) G/C
d) G/U

View Answer

Answer: d [Reason:] As in DNA, the G/C base pairs contribute the greatest energetic stability to the molecule, with A/U base pairs contributing less stability than G/C, and G/U wobble base pairs contributing the least. From the RNA structures that have been solved, these base pairs and a number of additional ones have been identified.

5. In predicting RNA secondary structure, some simplifying assumptions are usually made, like–the _____ structure is similar to the _____
a) most likely, energetically most unstable structure
b) most unlikely, energetically most stable structure
c) most likely, energetically most stable structure
d) least likely, energetically most stable structure

View Answer

Answer: c [Reason:] The assumption here is that the most predicted or likely structure has to be similar to the energetically most stable structure. The abundance is not taken into consideration in this.

6. The Second assumption in predicting RNA secondary structure is that, the energy associated with any position in the structure is _____ influenced by local sequence and structure.
a) only
b) not at all
c) partially
d) never

View Answer

Answer: a [Reason:] the energy associated with a particular base pair in a double-stranded region is assumed to be influenced only by the previous base pair and not by the base pairs farther down the double-stranded region or anywhere else in the structure. These energies can be reliably estimated by experimentation with small, synthetic RNA oligonucleotides recently improved to include sequence dependence.

7. The third assumption in predicting RNA secondary structure is that, the structure is assumed to be formed by _____ of the chain back on itself in a manner that ________
a) crossing, produces knots
b) crossing, does not produce any knots
c) folding, produces knots
d) folding, does not produce any knots

View Answer

Answer: d [Reason:] The best way of representing this requirement is to draw the sequence in a circular form. The paired bases are then joined by arcs. If the total structure with all predicted base pairs is to be free of knots, none of the arcs must cross.

8. Martinez (1984) made a list of possible double-stranded regions, and these regions were then given weights in proportion to their equilibrium constants, calculated by ______
a) the Boltzmann function [ exp (-∆G/RT2) ].
b) the Boltzmann function [ exp (-∆G/RT) ].
c) the Boltzmann function [ exp (-∆G/RT -T) ].
d) the Boltzmann function [ exp (∆G/RT) ].

View Answer

Answer: b [Reason:] here, the (-∆G) is the free energy of the regions, R is the gas constant, and T is the temperature. The RNA molecule is folded by a Monte Carlo method in which one initial region is chosen at random from a weighted pool, similar to the method used in Gibbs sampling.

9. In 1971, first estimation of the energy associated with regions of secondary structure by extrapolation from studies with small molecules was done and then attempt was made to predict which configurations of larger molecules were the most energetically stable.
a) True
b) False

View Answer

Answer: a [Reason:] Energy estimates included the stabilizing energy associated with stacking base pairs in a double-stranded region and the destabilizing influence of regions that were not paired. Pipas and McMahon (1975) developed computer programs that listed all possible helical regions in tRNA sequences.

10. Nussinov and Jacobson (1980) were the first to design a precise and efficient algorithm for predicting secondary structure.
a) True
b) False

View Answer

Answer: a [Reason:] The algorithm generates two scoring matrices—one M (i,j) to keep track of the maximum number of base pairs that can be formed in any interval i to j in the sequence. The second K (i,j) is to keep track of the base position k that is paired with j.

Set 5

1. When did Smith–Waterman first describe the algorithm for local alignment?
a) 1950
b) 1970
c) 1981
d) 1925

View Answer

Answer: c [Reason:] The algorithm was first proposed by Temple F. Smith and Michael S. Waterman in 1981. The Smith–Waterman algorithm performs local sequence alignment; that is, for determining similar regions between two strings of nucleic acid sequences or protein sequences.

2. Which of the following does not describe local alignment?
a) A local alignment aligns a substring of the query sequence to a substring of the target sequence
b) A local alignment is defined by maximizing the alignment score, so that deleting a column from either end would reduce the score, and adding further columns at either end would also reduce the score
c) Local alignments have terminal gaps
d) The substrings to be examined may be all of one or both sequences; if all of both are included then the local alignment is also global

View Answer

Answer: c [Reason:] Local alignments never have terminal gaps, because a higher score could be obtained by deleting the gaps (which always have negative scores, i.e. penalties). In case of global alignment there are terminal gaps while analyzing.

3. Which of the following does not describe local alignment algorithm?
a) Score can be negative
b) Negative score is set to 0
c) First row and first column are set to 0 in initialization step
d) In traceback step, beginning is with the highest score, it ends when 0 is encountered

View Answer

Answer: a [Reason:] Score can be negative. When any element has a score lower than zero, it means that the sequences up to this position have no similarities; this element will then be set to zero to eliminate influence from previous alignment. In this way, calculation can continue to find alignment in any position afterwards.

4. Local alignments are more used when_____________
a) There are totally similar and equal length sequences
b) Dissimilar sequences are suspected to contain regions of similarity
c) Similar sequence motif with larger sequence context
d) Partially similar, different length and conserved region containing sequences

View Answer

Answer: a [Reason:] The given description is suitable for global alignment. It attempts to align maximum of the entire sequence unlike local alignment where the partially similar sequences are analyzed.

5. Which of the following does not describe BLOSUM matrices?
a) It stands for BLOcks SUbstitution Matrix
b) It was developed by Henikoff and Henikoff
c) The year it was developed was 1992
d) These matrices are logarithmic identity values

View Answer

Answer: d [Reason:] These matrices are actual percentage identity values. Or simply, they depend on similarity. Blosum 62 means there is 62 % similarity.

6. Which of the following is untrue regarding the gap penalty used in dynamic programming?
a) Gap penalty is subtracted for each gap that has been introduced
b) Gap penalty is added for each gap that has been introduced
c) The gap score defines a penalty given to alignment when we have insertion or deletion
d) Gap open and gap extension has been introduced when there are continuous gaps (five or more)

View Answer

Answer: b [Reason:] Dynamic programming algorithms use gap penalties to maximize the biological meaning. T he open penalty is always applied at the start of the gap, and then the other gaps following it is given with a gap extension penalty which will be less compared to the open penalty. Typical values are –12 for gap opening, and –4 for gap extension.

7. Among the following which one is not the approach to the local alignment?
a) Smith–Waterman algorithm
b) K-tuple method
c) Words method
d) Needleman-Wunsch algorithm

View Answer

Answer: d [Reason:] Local alignment can be distinguished on two broad approaches– Smith–Waterman algorithm and word methods, also known as k-tuple methods and they are implemented in the well-known families of programs FASTA and BLAST.

8. Which of the following does not describe k-tuple methods?
a) k-tuple methods are best known for their implementation in the database search tools FASTA and the BLAST family
b) They are also known as words methods
c) They are basically heuristic methods to find local alignment
d) They are useful in small scale databases

View Answer

Answer: d [Reason:] k-tuple or word methods are especially useful in large-scale database searches where a large proportion of stored sequences will have essentially no significant match with the query sequence. They are heuristic methods that are not guaranteed to find an optimal alignment solution, but are significantly more efficient than Smith-Waterman algorithm.

9. Which of the following does not describe BLAST?
a) It stands for Basic Local Alignment Search Tool
b) It uses word matching like FASTA
c) It is one of the tools of the NCBI
d) Even if no words are similar, there is an alignment to be considered

View Answer

Answer: d [Reason:] If no words are similar, there is no alignment i. e. it will not find matches for very short sequences. But it is considerably accurate as compared to other tools and hence is quite popular.

10. Which of the following is untrue regarding BLAST and FASTA?
a) FASTA is faster than BLAST
b) FASTA is the most accurate
c) BLAST has limited choices of databases
d) FASTA is more sensitive for DNA-DNA comparisons

View Answer

Answer: a [Reason:] BLAST is faster than FASTA and most other tools. The speed and relatively good accuracy of BLAST is the key why the tool is the most popular bioinformatics search tool.