理学 全局对比 释 Needleman-Wunsch algorithm 全局序列比对算法 通过逐步延长子路径得到两个完整序列之间的最优化比对，是动态规划算法。又称内德勒曼-温施算法（Needleman-Wunsch algorithm）。
计算机交叉学科 生物信息学 释文 Needleman-Wunsch algorithm 内格勒曼-温施算法
- universal linear space
- universal link
- universal logical system
- Universal Love
- universal love/inclusive care
- universally-applicable judicial interpretations
- universally axiomatizable class
- universally Baire set
- universally beneficial social welfare policies
- universally catenary ring
- universally closed mapping
- universally closed morphism
- universally equivalent systems
- universally Japanese ring
- universally measurable
- universally measurable set
- universally optimum programming
- universally submersive morphism
- universally valid formula
- universal machine
- Universal Machine Readable Catalogue Format
- universal manifold
- universal manometer
- universal mapping
- universal mapping property