理学 全局对比 释 Needleman-Wunsch algorithm 全局序列比对算法 通过逐步延长子路径得到两个完整序列之间的最优化比对，是动态规划算法。又称内德勒曼-温施算法（Needleman-Wunsch algorithm）。
计算机交叉学科 生物信息学 释文 Needleman-Wunsch algorithm 内格勒曼-温施算法
- Taiyuan Pendi
- Taiyuan Satellite Launching Center
- Taiyuan Shi
- Taiyuan University of Technology
- Taiyue
- Taiyue Shanmai
- Tai, Yuin-Kwei
- Taizhong Pendi
- Taizhou City
- Taizhou Gang
- Taizhou Luantan opera
- Taizhou Museum
- Taizhou Pharmaceutical High-Tech Industrial Development Zone
- Tai Zhou school
- Taizhou Shi
- Taizhou Subgroup of Wu dialects
- Taizhou Wan
- Taizhou Yangtze River Bridge
- Taizhou Yinjiang Canal Project
- Taizhung Port
- Taizihe Qu
- Taiziwan park in Hangzhou
- Taizu Quan
- Tai’an Museum
- Tajalli