Skip to search formSkip to main contentSkip to account menu

Smith–Waterman algorithm

Known as: Smith algorithm, Local alignment, Smith-Waterman 
The Smith–Waterman algorithm performs local sequence alignment; that is, for determining similar regions between two strings or nucleotide or protein… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
Whilst light is essential for photosynthesis and development of plants, both excess photosynthetically active radiation and… 
2008
2008
In this paper we adapted a novel approach for accelerating the Smith-Waterman (S-W) algorithm using Recursive Variable Expansion… 
2008
2008
The Smith-Waterman (SW) algorithm is a local sequence alignment algorithm that attempts to align two biological sequences of… 
2007
2007
Efficient sequence alignment is one of the most important and challenging activities in bioinformatics. Many algorithms have been… 
2006
2006
Smith-Waterman algorithm is used to search bioinformatics databases. The systolic array implementations of this algorithm can… 
2005
2005
Carbon nanotube thin films with ordered structures have been developed from a highly concentrated suspension of nanotubes; this… 
Review
1976
Review
1976
A sampler and an anaJytica1 and characterization scheme were developed to investigate the chemical and physical state of iron in… 
1975
1975
Equivalent circuits for interdigital transducers were previously published which predict identical terminal properties as those… 
1957
1957
1. Quantitative experiments are described, designed to test the hypothesis that underwater polarized light is used for… 
Highly Cited
1944
Highly Cited
1944