As multiple sequence alignment problem is an NPC problem, so its optimum solution cannot be obtained because of the time and space limits.
多序列比对问题是一个NPC问题，由于时间和空间的限制不能够求出精确解。
Sequence alignment is a NP Complete problem and a great challenge to any quick and accurate algorithms.
多序列比对问题是NP完全问题，研究快而精确的算法是一个巨大的挑战。
RNA sequence-structure alignment is a basic problem in bioinformatics.
RNA序列结构比对是生物信息学中的基本问题。
Multiple Sequence alignment (MSA) is a typical NP-Complete problem. Star alignment is an effective algorithm for MSA.
多序列比对(msa)是一个典型的NP完全问题，星比对是一种有效的多序列比对算法。
Multiple Sequence alignment (MSA) is a typical NP-Complete problem. Star alignment is an effective algorithm for MSA.
多序列比对(msa)是一个典型的NP完全问题，星比对是一种有效的多序列比对算法。
应用推荐