序列（生物学）
计算生物学
组合数学
序列比对
数学
作者
Lusheng Wang,Tao Jiang
标识
DOI：10.1089/cmb.1994.1.337
摘要
ABSTRACT We study the computational complexity of two popular problems in multiple sequence alignment: multiple alignment with SP-score and multiple tree alignment. It is shown that the first problem is NP-complete and the second is MAX SNP-hard. The complexity of tree alignment with a given phylogeny is also considered.
科研通智能强力驱动
Strongly Powered by AbleSci AI
从容芮
HEIKU
个性归尘
OCDer
bc
爱静静
yydragen
zho
帮主哥哥
遇上就这样吧
若雨凌风
妖娃娃
sunyz
aldehyde
jenningseastera
dabaigou
斯寜
兔兔
请叫我风吹麦浪
jyy
皖公网安备34019202002308
