题海让大学四年没有难题
白天模式登陆

题目详情

单选题 A global alignment algorithm (such as the Needleman–Wunsch algorithm) is guaranteed to find an optimal alignment. ( )Such an algorithm

A. Puts the two proteins being compared into a matrix and finds the optimal score by exhaustively searching every possible combination of alignments

B. Puts the two proteins being compared into a matrix and finds the optimal score by iterative recursions

C. Puts the two proteins being compared into a matrix and finds the optimal alignment by finding optimal subpaths that define the best alignment(s)

D. Can be used for proteins but not for DNA sequences %

默认课程课程封面

学科：默认课程

时间：2025-12-18 13:17:14

相关题目

相关作业

题目1
单选题
Orthologs are defined as ( )
A. Homologous sequences in different species that share an ancestral geneB. Homologous sequences that share little amino acid identity but share great structural similarityC. Homologous sequences in the same species that arose through gene duplicationD. Homologous sequences in the same species which have similar and often redundant functions
题目2
单选题
Which of the following sentences best describes the difference between a global alignment and a local alignment between two sequences
A. Global alignment is usually used forDNAsequences, while local alignment is usually used for protein sequencesB. Global alignment has gaps, while local alignment does not have gapsC. Global alignment finds the global maximum, while local alignment finds the local maximumD. Global alignment aligns the whole sequence, while local alignment finds the best subsequence that aligns
题目3
单选题
下列哪个句子最好的描述了两个序列全局比对和局部比对的不同:( )
A. 全局比对通常用于比对DNA序列,而局部比对通常用于比对蛋白质序列B. 全局比对允许间隙,而局部比对不允许C. 全局比对寻找全局最大化,而局部比对寻找局部最大化D. 全局比对比对整体序列,而局部比对寻找最佳匹配子序列
题目4
单选题
matrix should be used for aligning sequences that are about 20% similar
A. PAM250B. PAM120C. PAM 30D. PAM 70
题目5
单选题
PAM250矩阵定义的进化距离为两同源序列在给定的时间有多少百分比的氨基酸发生改变:( )
A. 1%B. 20%C. 80%D. 250%
题目6
单选题
A global alignment algorithm (such as the Needleman–Wunsch algorithm) is guaranteed to find an optimal alignment. ( )Such an algorithm
A. Puts the two proteins being compared into a matrix and finds the optimal score by exhaustively searching every possible combination of alignmentsB. Puts the two proteins being compared into a matrix and finds the optimal score by iterative recursionsC. Puts the two proteins being compared into a matrix and finds the optimal alignment by finding optimal subpaths that define the best alignment(s)D. Can be used for proteins but not for DNA sequences %
题目7
单选题
NCBI 网页提供的blastp 服务默认的matrix是( )
A. BLOSUM 45B. BLOSUM 62C. BLOSUM 50D. BLOSUM 90
Copyright © 2022 津ICP备2021001502号