Bissoy.com
Doctors Medicines MCQs Q&A

There are two approaches viz. exhaustive and heuristic approaches used in multiple sequence alignment.

There are two approaches viz. exhaustive and heuristic approaches used in multiple sequence alignment. Correct Answer True

The exhaustive alignment method involves examining all possible aligned positions simultaneously. Similar to dynamic programming in pair wise alignment, which involves the use of a two-dimensional matrix to search for an optimal alignment, to use dynamic programming for multiple sequence alignment, extra dimensions are needed to take all possible ways of sequence matching into consideration.

Related Questions

Par Align is a web-based server that uses parallel processors to perform exhaustive sequence comparisons using either a parallelized version of the Smith–Waterman algorithm or a heuristic program for further speed gains.
Consider the following statements: 1. If A and B are exhaustive events, then their union is the sample space. 2. If A and B are exhaustive events, then their intersection must be an empty event. Which of the above statements is / are correct?
The predefined alignment requiring method also depends on the quality of the input alignment. If there ___ errors in the alignment, covariation signals ____ detected.
The resulting tree is then used to guide the alignment of the most closely related sequences and groups of sequences. The resulting alignment is a global alignment produced by the Needleman-Wunsch algorithm.
A treasure chest has less than 100 gold coins. The number of coin is i) One more than a multiple of 3 ii) Two more than a multiple of 4 iii) Three more than a multiple of 5 and iv) Four more than a multiple of 6 How many coins are there in the chest?
In protein/domain analysis, each protein in the predicted proteome is again used as a query of a curated protein sequence database such as ____ in order to locate similar domains and sequences. To find orthologs, very low E value scores (E<10<20) for the alignment score and an alignment that includes 60–80% of the query sequence are generally required in order to avoid matches to paralogs.
The scoring of gaps in a MSA (Multiple Sequence Alignment) has to be performed in a different manner from scoring gaps in a pair-wise alignment.
An approach for obtaining a higher-scoring MSA (Multiple Sequence Alignment) by rearranging an existing alignment uses a probability approach called simulated annealing.
Suppose you are compiling on a machine with 1-byte chars, 2-byte shorts, 4-byte ints, and 8-byte doubles, and with alignment rules that require the address of every primitive data element to be an integer multiple of the element's size. Suppose further that the compiler is not permitted to reorder fields: padding is used to ensure alignment. How much space will be consumed by the following array? struct { short s; char c; short t; char d; double r; int i; } A[10]; /*10-element array of structs*/
P,Q, R, S, T, V and W are seven friends .Each of them likes a particular fruit, viz. Apple, Banana, pear, Guava , Orange, Mango and Watermelon and each of them has a favorite city, viz. Mumbai , pune, Delhi, Kolkata, chennai, Hyderabad and Cochin . The choices of fruit and favorite city of the seven friends aren't necessarily in the same order. Q likes Mango and his favorite city is chennai . The one shose favorite city is pune likes Watermelon . T's favorite city is Kolkata. R likes Guava and is favorite is not Mumbai. W's favorite city is cochin and he does not lide either Banana or pear. The favorite city of the one who likes Orange is Hyderabad. T does no like pear. P's favorite city is neither Pune nor Hyderabad. S does not like Watermelon . who likes Apple?