摘要
多重序列的比对(Alignment)的核心问题是对多重DNA(或RNA、蛋白质)序列,寻找它们的相似部分或稳定区域,但如何定义多重序列的相似度(或罚分函数)则是解决多重序列比对的前提。首先对多重序列相似度的合理性进行了讨论,给出了一组合理的相似度所必需具备的条件;再利用Shannon熵的特点,给出一个满足这些合理性条件的多重序列比对的优化准则。
The key of the alignment problem for the multiple biology sequences(DNA, RNA, or Pritein) is finding their similar part or stable region. So, the definition of the similarity measure or the cost function is a presupposition for the MSA. In this paper, we first give some rationality conditions of the similarity, then we give an optimization measure criterion using the Shannon entropy. This optimization measure criterion is a satisfaction to these similarity conditions.
出处
《工程数学学报》
CSCD
北大核心
2002年第4期1-10,共10页
Chinese Journal of Engineering Mathematics
基金
获刘徽应用数学研究中心资助.
关键词
多重序列比对
多重序列
相似度
罚分函数
信息度量准则
multiple sequences alignment(MSA)
similarity measure or cost function
information measure criterion