MCQs
Total Questions : 165
| Page 4 of 17 pages
Answer: Option B. -> A neighbor-joining algorithm is rarely used in this method
Answer: (b).A neighbor-joining algorithm is rarely used in this method
Answer: (b).A neighbor-joining algorithm is rarely used in this method
Answer: Option C. -> One way to identify the most strongly supported clusters is simply to remove the most weakly supported edges in the graph
Answer: (c).One way to identify the most strongly supported clusters is simply to remove the most weakly supported edges in the graph
Answer: (c).One way to identify the most strongly supported clusters is simply to remove the most weakly supported edges in the graph
Answer: Option A. -> A comparison of each protein in the proteome with all other proteins distinguishes unique proteins from proteins that have arisen from gene duplication, and also reveals the number of protein families but the domain content of these proteins cannot be known
Answer: (a).A comparison of each protein in the proteome with all other proteins distinguishes unique proteins from proteins that have arisen from gene duplication, and also reveals the number of protein families but the domain content of these proteins cannot be known
Answer: (a).A comparison of each protein in the proteome with all other proteins distinguishes unique proteins from proteins that have arisen from gene duplication, and also reveals the number of protein families but the domain content of these proteins cannot be known
Answer: Option C. -> The P or E value from BLAST searches cannot be the criterion for a matching protein pair
Answer: (c).The P or E value from BLAST searches cannot be the criterion for a matching protein pair
Answer: (c).The P or E value from BLAST searches cannot be the criterion for a matching protein pair
Answer: Option A. -> True
Answer: (a).True
Answer: (a).True
Answer: Option C. -> The conservative approach is to group distinct sequences
Answer: (c).The conservative approach is to group distinct sequences
Answer: (c).The conservative approach is to group distinct sequences
Answer: Option B. -> Many sequences arise from near the 5’ end of the mRNA, although every effort is usually made to read as far 3’ as possible into the upstream portion of the cDNA
Answer: (b).Many sequences arise from near the 5’ end of the mRNA, although every effort is usually made to read as far 3’ as possible into the upstream portion of the cDNA
Answer: (b).Many sequences arise from near the 5’ end of the mRNA, although every effort is usually made to read as far 3’ as possible into the upstream portion of the cDNA
Answer: Option D. -> each of the orthologs belongs to a family composed of paralogous sequences but irrelevant or not related to each other
Answer: (d).each of the orthologs belongs to a family composed of paralogous sequences but irrelevant or not related to each other
Answer: (d).each of the orthologs belongs to a family composed of paralogous sequences but irrelevant or not related to each other
Answer: Option B. -> Paralogs defined by sets of three matching sequences in the selected organisms were kept separated from the clusters
Answer: (b).Paralogs defined by sets of three matching sequences in the selected organisms were kept separated from the clusters
Answer: (b).Paralogs defined by sets of three matching sequences in the selected organisms were kept separated from the clusters
Answer: Option A. -> Searches of EST databases for matches to a query sequence routinely produce minimal amounts of output that must be searched manually for significant hits
Answer: (a).Searches of EST databases for matches to a query sequence routinely produce minimal amounts of output that must be searched manually for significant hits
Answer: (a).Searches of EST databases for matches to a query sequence routinely produce minimal amounts of output that must be searched manually for significant hits