Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation

@inproceedings{Rognes2011FasterSD,
  title={Faster Smith-Waterman database searches with inter-sequence SIMD parallelisation},
  author={Torbj\orn Rognes},
  booktitle={BMC Bioinformatics},
  year={2011}
}
The Smith-Waterman algorithm for local sequence alignment is more sensitive than heuristic methods for database searching, but also more time-consuming. The fastest approach to parallelisation with SIMD technology has previously been described by Farrar in 2007. The aim of this study was to explore whether further speed could be gained by other approaches to parallelisation. A faster approach and implementation is described and benchmarked. In the new tool SWIPE, residues from sixteen different… CONTINUE READING
Highly Influential
This paper has highly influenced 24 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 163 citations. REVIEW CITATIONS
91 Citations
22 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 91 extracted citations

163 Citations

02040'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 163 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 22 references

Accurate Scanning of Sequence Databases with the Smith-Waterman Algorithm. GPU Computing Gems, Emerald Edition

  • Ł Ligowski, WR Rudnicki, Y Liu, B Schmidt
  • 2011
2 Excerpts

optimizing Smith - Waterman sequence database searches for CUDA - enabled graphics processing units

  • B Schmidt, DL Maskell
  • BMC Res Notes
  • 2009

Similar Papers

Loading similar papers…