FAQ

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… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1987-2017
0204019872017

Related topics

Related topics

33 relations
Approximate string matchingBLASTBacktrackingBioJava
(More)

Broader (2)

Computational phylogeneticsDynamic programming

Related mentions per year

Related mentions per year

1937-2018
19401960198020002020
Smith–Waterman algorithm
Mathematical optimization
Scalability
Field-programmable gate array
Dynamic programming
Homology

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Optimizing Smith-Waterman algorithm on Graphics Processing Unit
Local Sequence alignment is an important task for bioinformatics. The most widely used algorithm is Smith-Waterman [1] has a… (More)
  • figure I
  • figure 2
Is this relevant?
2010
2010
Implementation of Smith-Waterman Algorithm in OpenCL for GPUs
In this paper we present an implementation of the Smith-Waterman algorithm. The implementation is done in OpenCL and targets high… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2009
Highly Cited
2009
An efficient implementation of Smith Waterman algorithm on GPU using CUDA, for massively parallel scanning of sequence databases
The Smith Waterman algorithm for sequence alignment is one of the main tools of bioinformatics. It is used for sequence… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
Plagiarism Detection Using the Levenshtein Distance and Smith-Waterman Algorithm
Plagiarism in texts is issues of increasing concern to the academic community. Now most common text plagiarism occurs by making a… (More)
  • table 1
  • figure 1
  • figure 3
  • table 2
Is this relevant?
2008
2008
Efficient partial shape matching using Smith-Waterman algorithm
This paper presents an efficient partial shape matching method based on the Smith-Waterman algorithm. For two contours of m and n… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 3
  • table 1
Is this relevant?
Highly Cited
2008
Highly Cited
2008
CUDA compatible GPU cards as efficient hardware accelerators for Smith-Waterman sequence alignment
Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman… (More)
  • table 1
  • table 2
  • table 3
  • figure 6
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Striped Smith-Waterman speeds database searches six times over other SIMD implementations
MOTIVATION The only algorithm guaranteed to find the optimal local alignment is the Smith-Waterman. It is also one of the slowest… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 6
Is this relevant?
2004
2004
Plagiarism and Collusion Detection using the Smith-Waterman Algorithm
We investigate the use of variants of the Smith-Waterman algorithm to locate similarities in texts and in program source code… (More)
  • table 1
  • figure 2
  • figure 5
  • figure 7
  • figure 8
Is this relevant?
2002
2002
A parallel Smith-Waterman algorithm based on divide and conquer
Biological sequence comparison is an important tool for researchers in molecular biology. There are several algorithms for… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Six-fold speed-up of Smith-Waterman sequence database searches using parallel processing on common microprocessors
MOTIVATION Sequence database searching is among the most important and challenging tasks in bioinformatics. The ultimate choice… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?