2 search results - page 1 / 1 » Faster Smith-Waterman database searches with inter-sequence ... |
BMCBI
2011
13 years 2 months ago
2011
Background: The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest ap...
BMCBI
2008
13 years 11 months ago
2008
Background: Searching for similarities in protein and DNA databases has become a routine procedure in Molecular Biology. The Smith-Waterman algorithm has been available for more t...