理学 全局对比 释 Needleman-Wunsch algorithm 全局序列比对算法 通过逐步延长子路径得到两个完整序列之间的最优化比对，是动态规划算法。又称内德勒曼-温施算法（Needleman-Wunsch algorithm）。
计算机交叉学科 生物信息学 释文 Needleman-Wunsch algorithm 内格勒曼-温施算法
- the both of man's nature and feelings are good
- The Bot of WatSuthatthepwararam
- the boundary point of conjugate tooth-surfaces
- the bounding function of conjugate tooth-surfaces
- The Branches Are Covered with Fruitage
- the branch of publishing science
- The Brave Heart Will Take the Bride
- the break point
- the bridge and tunnel engineering across the sea
- The Bridge on the River Kwai
- The Brief History of Museums in China
- The Brief History of Museums in Foreign Countries
- the brief history of the evolution of livelihood theory
- the Brief Introduction to the Origin of Chinese Buddhism
- the Brief Introduction to the Origin of Indian Buddhism
- The Bright Eleven
- the Bright Moon at the Dawn
- The Bright Star Catalogue
- The Brilliant World and the Light of Soul, Works of Stage Lighting Designer Zhou Zhengping
- The Brink
- The British Academy of Film and Television Arts
- The British Association of Dramatherapists
- the British documentary movement
- The British Early Childhood Education Research Association
- The British Journal of Photography