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 rearrangedI got this question in an internship interview.This interesting question is from Iterative Methods of Multiple Sequence Alignment in portion Multiple Sequence Alignment of Bioinformatics

In Genetic Algorithm, in the mutation process _______(a) sequence is c

1.	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 rearrangedI got this question in an internship interview.This interesting question is from Iterative Methods of Multiple Sequence Alignment in portion Multiple Sequence Alignment of Bioinformatics
Answer» CORRECT choice is (c) sequence is not changed The BEST I can explain: In the mutation PROCESS, the sequence is not changed (ELSE it would no longer be an ALIGNMENT), but gaps are inserted and rearranged in an attempt to create a better-scoring MSA. In the gap insertion process, the sequences in a given MSA are divided into two groups based on an estimated phylogenetic tree, and gaps of random length are inserted into random positions in the alignment.

Discussion

No Comment Found

Related InterviewSolutions

GDE (Genetic Data Environment) provides a general interface on UNIX machines for sequence analysis, sequence alignment editing, and display.(a) True(b) FalseI got this question in an interview for internship.The question is from Position topic in section Multiple Sequence Alignment of Bioinformatics
In the intermediate steps of EM algorithm, the number of each base in each column is determined and then converted to fractions.(a) True(b) FalseI have been asked this question in an interview.The origin of the question is Statistical Methods for Aiding Alignment in chapter Multiple Sequence Alignment of Bioinformatics
A dotplot is a visual and qualitative technique whereas the sequence alignment is an exact and quantitative measure of similarity of alignments.(a) True(b) FalseThe question was posed to me in an online quiz.This question is from Needleman topic in chapter Multiple Sequence Alignment of Bioinformatics
Out of the two repeated steps in EM algorithm, the step 2 is ________(a) the maximization step(b) the minimization step(c) the optimization step(d) the normalization stepThe question was asked in a national level competition.My question is based upon Statistical Methods for Aiding Alignment in chapter Multiple Sequence Alignment of Bioinformatics
In a multidimensional search matrix, for aligning N sequences, an (N+2)-dimensional matrix is needed to be filled with alignment scores.(a) True(b) FalseThis question was addressed to me in an online quiz.The doubt is from Exhaustive Algorithms in portion Multiple Sequence Alignment of Bioinformatics
An alternative method is to produce an odds scoring matrix calculated by dividing each base frequency by the background frequency of that base.(a) True(b) FalseI have been asked this question in semester exam.I need to ask this question from Statistical Methods for Aiding Alignment topic in portion Multiple Sequence Alignment of Bioinformatics
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) True(b) FalseI had been asked this question in an interview for job.My question is from Progressive Methods of Multiple Sequence Alignment topic in portion Multiple Sequence Alignment of Bioinformatics
Which of the following is untrue regarding the block analysis method?(a) Blocks represent a conserved region in the MSA(b) Blocks differ from profiles in lacking insert and delete positions in the sequences(c) Every column includes only matches and mismatches(d) Blocks may be made by searching for a section of an MSA alignment that is low conservedThis question was posed to me during a job interview.I need to ask this question from Localized Alignments in Sequences in portion Multiple Sequence Alignment of Bioinformatics
The second step in the Genetic Algorithm comprises of scoring of the 100 initial MSAs by the sum of pairs method.(a) True(b) FalseI have been asked this question in a national level competition.This interesting question is from Iterative Methods of Multiple Sequence Alignment topic in section Multiple Sequence Alignment of Bioinformatics
Which of the following is untrue about Needleman-Wunsch algorithm?(a) It is an example of dynamic programming(b) Basic idea here is to build up the best alignment by using optimal alignments of larger subsequences(c) It was first used by Saul Needleman and Christian Wunsch(d) It was first used in 1970This question was posed to me during an online interview.Query is from Needleman topic in section Multiple Sequence Alignment of Bioinformatics

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment