pair-wiseCOCA¹⁰⁰⁴²³BNC⁹⁷²³³⁺⁷ 基本例句 双向的，两两的 Pair-wise sequence alignment is solved by dynamic programming while multiple sequence alignment belongs to NP- complete combinatorial optimization problem and is still solved completely. 二重序列比对问题可采用动态规划方法求得其最优解；多重序列比对问题是一个NP完全的组合优化问题，有待进一步探索与研究。 tech.zidian8.com