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.
2009
2009
In this paper, we present a performance comparison between linear recursive variable expansion (RVE) and linear systolic… 
2009
2009
The Smith-Waterman algorithm accelerator with backtracking,which has not been implemented in hardware before,is designed and… 
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… 
2007
2007
Abstract Mudcracks originally more than 2 m deep are directly superimposed on profundal lacustrine mudstone of the lower LaClede… 
2006
2006
Smith-Waterman algorithm is used to search bioinformatics databases. The systolic array implementations of this algorithm can… 
1982
1982
, “On scattering of waves by random distributions-11: Two space formalism,” J. Marh. Phys., vol. 3, pp. 724-734, 1962… 
1975
1975
Equivalent circuits for interdigital transducers were previously published which predict identical terminal properties as those… 
1959
1959
SummaryTests conducted on a pilot-plant scale have demonstrated that linoleic acid of about 95% purity may be produced from… 
1957
1957
1. Quantitative experiments are described, designed to test the hypothesis that underwater polarized light is used for…