In the Vinony graph
Within Vinony's link graph, Needleman–Wunsch algorithm is referenced by 80 other articles, and connects out to sequence mining, protein and International Standard Book Number.
It sits within the topics Bioinformatics algorithms, Computational phylogenetics and Dynamic programming.
Its subject is documented across 19 Wikipedia language editions.
Wikidata facts
- Image
- Needleman-Wunsch pairwise sequence alignment.png
- Has use
- bioinformatics
Show 2 more facts
- inception
- 1970-00-00
- Commons category
- Needleman–Wunsch algorithm
Sources (1)
via Wikidata · CC0
Article · 中文
尼德曼-翁施算法（英語：Needleman-Wunsch Algorithm）是基于生物信息学的知识来匹配蛋白序列或者DNA序列的算法。这是将动态算法应用于生物序列的比较的最早期的几个实例之一。该算法是由 Saul B. Needlman和 Christian D. Wunsch 两位科学家于1970年发明的。本算法高效地解决了如何将一个庞大的数学问题分解为一系列小问题，并且从一系列小问题的解决方法重建大问题的解决方法的过程。该算法也被称为优化匹配算法和整体序列比较法。时至今日尼德曼-翁施算法仍然被广泛应用于优化整体序列比较中。
Abstract from DBpedia / Wikipedia · CC BY-SA
Connections
sequence mining
Entity
protein
Entity
International Standard Book Number
Entity
algorithm
Entity
digital object identifier
Entity
matrix
Entity
bioinformatics
Entity
nucleotide
Entity
data structure
Entity
artificial neural network
Entity
pixel
Entity
OCLC, Inc.
Entity
PubMed
Entity
regular expression
Entity
recursion
Entity
bibcode
Entity
PubMed Central
Entity
array data structure
Entity
string
Entity
Levenshtein distance
Entity