Skip to search formSkip to main contentSkip to account menu

Needleman–Wunsch algorithm

Known as: Needleman–Wunsch distance, Needleman and wuncsh, Needleman-Wuncsh 
The Needleman–Wunsch algorithm is an algorithm used in bioinformatics to align protein or nucleotide sequences. It was one of the first applications… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
Polymorphic malware is currently hard to detect. Such malware is able to mutate into functionally identical variants of… 
2014
2014
In this paper, an anisotropic formulation of the Gurson-Tvergaard-Needleman (GTN) damage model is used for simulating the deep… 
2012
2012
This paper presents AUTOMSv2 effort towards building a tool for the automated alignment of domain ontologies. The developed tool… 
2007
2007
Der quantitativ weit vorangeschrittene Verberuflichungsprozess institutionalisierter Gleich­stellungsarbeit lasst Forderungen… 
2004
2004
  • Z. DuF. Lin
  • 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… 
2003
2003
ZusammenfassungOperationsziel Wiederherstellung der Extension des Handgelenks und der Langfingergrundgelenke sowie der Abduktion… 
2002
2002
Many problems in bioinformatics relate to the comparison of two DNA or protein sequences. Given two sequences, we often wish to… 
1994
1994
  • S. Guha
  • 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… 
1985
1985
  • K. Sloan
  • 1985
  • Corpus ID: 206623189
The modular multiplication algorithm (MMA) was presented as a method of calculating " the smallest nonnegative integer R… 
Review
1974
Review
1974
Several econometric models for the analysis of relationships with limited dependent variables have been proposed, including the…