No retraction, correction or concern found when last checked on Oct 22, 2026.

SSW Library: An SIMD Smith-Waterman C/C++ Library for Use in Genomic Applications

Mengyao Zhao, Wan-Ping Lee, Erik P. Garrison and 1 more

PLoS ONE · 2013 · CC BY

doi:10.1371/journal.pone.0082138

Abstract

Background. The Smith-Waterman algorithm, which produces the optimal pairwise alignment between two sequences, is frequently used as a key component of fast heuristic read mapping and variation detection tools for next-generation sequencing data. Though various fast Smith-Waterman implementations are developed, they are either designed as monolithic protein database searching tools, which do not return detailed alignment, or are embedded into other tools. These issues make reusing these efficient Smith-Waterman implementations impractical.

Results. To facilitate easy integration of the fast Single-Instruction-Multiple-Data Smith-Waterman algorithm into third-party software, we wrote a C/C++ library, which extends Farrar’s Striped Smith-Waterman (SSW) to return alignment information in addition to the optimal Smith-Waterman score. In this library we developed a new method to generate the full optimal alignment results and a suboptimal score in linear space at little cost of efficiency. This improvement makes the fast Single-Instruction-Multiple-Data Smith-Waterman become really useful in genomic applications. SSW is available both as a C/C++ software library, as well as a stand-alone alignment tool at: https://github.com/mengyao/Complete-Striped-Smith-Waterman-Library.

Conclusions. The SSW library has been used in the primary read mapping tool MOSAIK, the split-read mapping program SCISSORS, the MEI detector TANGRAM, and the read-overlap graph generation program RZMBLR. The speeds of the mentioned software are improved significantly by replacing their ordinary Smith-Waterman or banded Smith-Waterman module with the SSW Library.

Full text

Its licence does not allow us to show the full text. Read it at PubMed Central:

References 23

1.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
2.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
3.
MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping · 2014
No notice
4.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
5.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
6.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
7.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
8.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
9.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
10.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
11.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
12.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
13.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
14.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
15.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
16.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
17.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
18.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
19.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
20.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
21.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
22.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library
23.
This reference’s wording can’t be shown under the paper’s licence.
Not in our library

Cited by papers we hold 13

DynamicBind: predicting ligand-specific protein-ligand complex structure with a deep equivariant generative model · 2024
No notice
Deep-learning-enabled antibiotic discovery through molecular de-extinction · 2024
No notice
Fast and accurate protein structure search with Foldseek · 2023
No notice
GRIDSS2: comprehensive characterisation of somatic structural variation using single breakend variants and structural variant phasing · 2021
No notice
An integrative drug repositioning framework discovered a potential therapeutic agent targeting COVID-19 · 2021
No notice
Massively parallel single-cell B-cell receptor sequencing enables rapid discovery of diverse antigen-reactive antibodies · 2019
No notice
Paragraph: a graph-based structural variant genotyper for short-read sequence data · 2019
No notice
Clustering huge protein sequence sets in linear time · 2018
No notice
Survival of pancreatic cancer cells lacking KRAS function · 2017
No notice
CRISPR-Cpf1 mediates efficient homology-directed repair and temperature-controlled genome editing · 2017
No notice
Parasail: SIMD C library for global, semi-global, and local pairwise sequence alignments · 2016
No notice
Wham: Identifying Structural Variants of Biological Consequence · 2015
No notice
MOSAIK: A Hash-Based Algorithm for Accurate Next-Generation Sequencing Short-Read Mapping · 2014
No notice

Reads

Read by people on this page

None yet.

Checked or read by AI through naulon

None yet.

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.

Are you an author?

Is this your paper?

Claim it to add your note and be paid when agents cite it. Free.