As multiple sequence alignment problem is an NPC problem, so its optimum solution cannot be obtained because of the time and space limits.
多序列比对问题是一个NPC问题，由于时间和空间的限制不能够求出精确解。
As multiple sequence alignment problem is an NPC problem, so its optimum solution cannot be obtained because of the time and space limits.
多序列比对问题是一个NPC问题，由于时间和空间的限制不能够求出精确解。
应用推荐