理学 全局对比 释 Needleman-Wunsch algorithm 全局序列比对算法 通过逐步延长子路径得到两个完整序列之间的最优化比对，是动态规划算法。又称内德勒曼-温施算法（Needleman-Wunsch algorithm）。
计算机交叉学科 生物信息学 释文 Needleman-Wunsch algorithm 内格勒曼-温施算法
- quotient
- quotient algebra
- quotient bialgebra
- quotient bundle
- quotient category
- quotient chain complex
- quotient coalgebra
- quotient complex
- quotient-difference algorithm
- quotient-difference table
- quotient dimension
- quotient field
- quotient filtration
- quotient frame
- quotient function
- quotient functor
- quotient game
- quotient graph
- quotient group
- quotient G-set
- quotient ideal
- quotient lattice
- quotient law
- quotient Lie algebra
- quotient Lie group