Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 231,766,865 papers from all fields of science
Search
Sign In
Create Free Account
Needleman–Wunsch algorithm
Known as:
Needleman–Wunsch distance
, Needleman and wuncsh
, Needleman-Wuncsh
Expand
The Needleman–Wunsch algorithm is an algorithm used in bioinformatics to align protein or nucleotide sequences. It was one of the first applications…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
30 relations
Algorithm
Approximate string matching
Array data structure
BLOSUM
Expand
Broader (2)
Computational phylogenetics
Dynamic programming
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Needleman-Wunsch and Smith-Waterman Algorithms for Identifying Viral Polymorphic Malware Variants
Vijay Naidu
,
A. Narayanan
IEEE 14th Intl Conf on Dependable, Autonomic and…
2016
Corpus ID: 18192100
Polymorphic malware is currently hard to detect. Such malware is able to mutate into functionally identical variants of…
Expand
2016
2016
Parallel Digraphs-building Computer Algorithm for Finding a Set of Characteristic Polynomial Realisations of Dynamic System
Krzysztof Hryniów
,
K. Markowski
Journal of Automation, Mobile Robotics…
2016
Corpus ID: 208108009
2009
2009
An Ecient Implementation of Needleman Wunsch Algorithm on Graphical Processing Units
Chetan S. Khaladkar
2009
Corpus ID: 61877928
In bioinformatics, a sequence alignment is a way of arranging the sequences of DNA, RNA, or protein to classify regions of…
Expand
2007
2007
Neue Wege statt alter Pfade: Frauen- und Gleichstellungsarbeit auf dem Weg zur Profession
Anna Nigges-Gellrich
2007
Corpus ID: 142978177
Der quantitativ weit vorangeschrittene Verberuflichungsprozess institutionalisierter Gleichstellungsarbeit lasst Forderungen…
Expand
2004
2004
Improvement of the Needleman-Wunsch Algorithm
Z. Du
,
F. Lin
Rough Sets and Current Trends in Computing
2004
Corpus ID: 21935622
This paper provides a novel approach to improve the Needleman-Wunsch algorithm, one of the most basic algorithms in Protein or…
Expand
2003
2003
Biology Goes Digital
G. Tempesti
,
C. Teuscher
2003
Corpus ID: 2176523
2001
2001
A Computer Algorithm For Obtaining R, From The Sp Log
W. W. Souder
2001
Corpus ID: 132915710
1994
1994
An optimal mesh computer algorithm for constrained Delaunay triangulation
S. Guha
Proceedings of 8th International Parallel…
1994
Corpus ID: 41710247
We present an optimal parallel algorithm that runs in O(/spl radic/n) time on a /spl radic/n/spl timesspl radic/n mesh to compute…
Expand
Highly Cited
1988
Highly Cited
1988
Computer algorithm for selection of frequency relays for load shedding
J. Jones
,
W.D. Kirkland
IEEE Computer Applications in Power
1988
Corpus ID: 25207617
A technique is presented for designing a load-shedding scheme using underfrequency relays to limit the effect of system overloads…
Expand
Review
1974
Review
1974
On a General Computer Algorithm for the Analysis of Models with Limited Dependent Variables
F. Nelson
1974
Corpus ID: 60966205
Several econometric models for the analysis of relationships with limited dependent variables have been proposed, including the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE