Skip to main page content
U.S. flag

An official website of the United States government

Dot gov

The .gov means it’s official.
Federal government websites often end in .gov or .mil. Before sharing sensitive information, make sure you’re on a federal government site.

Https

The site is secure.
The https:// ensures that you are connecting to the official website and that any information you provide is encrypted and transmitted securely.

Access keys NCBI Homepage MyNCBI Homepage Main Content Main Navigation
. 2014 Jun 12:15:182.
doi: 10.1186/1471-2105-15-182.

Skewer: a fast and accurate adapter trimmer for next-generation sequencing paired-end reads

Hongshan Jiang  1 , Rong Lei, Shou-Wei Ding, Shuifang Zhu
Affiliations

Skewer: a fast and accurate adapter trimmer for next-generation sequencing paired-end reads

Hongshan Jiang et al. BMC Bioinformatics. .

Abstract

Background: Adapter trimming is a prerequisite step for analyzing next-generation sequencing (NGS) data when the reads are longer than the target DNA/RNA fragments. Although typically used in small RNA sequencing, adapter trimming is also used widely in other applications, such as genome DNA sequencing and transcriptome RNA/cDNA sequencing, where fragments shorter than a read are sometimes obtained because of the limitations of NGS protocols. For the newly emerged Nextera long mate-pair (LMP) protocol, junction adapters are located in the middle of all properly constructed fragments; hence, adapter trimming is essential to gain the correct paired reads. However, our investigations have shown that few adapter trimming tools meet both efficiency and accuracy requirements simultaneously. The performances of these tools can be even worse for paired-end and/or mate-pair sequencing.

Results: To improve the efficiency of adapter trimming, we devised a novel algorithm, the bit-masked k-difference matching algorithm, which has O(kn) expected time with O(m) space, where k is the maximum number of differences allowed, n is the read length, and m is the adapter length. This algorithm makes it possible to fully enumerate all candidates that meet a specified threshold, e.g. error ratio, within a short period of time. To improve the accuracy of this algorithm, we designed a simple and easy-to-explain statistical scoring scheme to evaluate candidates in the pattern matching step. We also devised scoring schemes to fully exploit the paired-end/mate-pair information when it is applicable. All these features have been implemented in an industry-standard tool named Skewer (https://sourceforge.net/projects/skewer). Experiments on simulated data, real data of small RNA sequencing, paired-end RNA sequencing, and Nextera LMP sequencing showed that Skewer outperforms all other similar tools that have the same utility. Further, Skewer is considerably faster than other tools that have comparative accuracies; namely, one times faster for single-end sequencing, more than 12 times faster for paired-end sequencing, and 49% faster for LMP sequencing.

Conclusions: Skewer achieved as yet unmatched accuracies for adapter trimming with low time bound.

PubMed Disclaimer

Figures

Figure 1
Figure 1
ROC curves of various adapter trimmers for processing single-end reads of simulated data. ROC: receiver operating characteristic.
Figure 2
Figure 2
ROC curves of various adapter trimmers for processing paired-end reads of simulated data. ROC: receiver operating characteristic.
Figure 3
Figure 3
Performance of various adapter trimmers on real small RNA data [SRA:SRR014966].
Figure 4
Figure 4
Performance of various adapter trimmers on real paired-end data [SRA:SRR330569].
Figure 5
Figure 5
Layout of paired-end reads that have adapter contaminants.
See this image and copyright information in PMC

References

    1. He HH, Meyer CA, Hu SS, Chen MW, Zang C, Liu Y, Rao PK, Fei T, Xu H, Long H, Liu XS, Brown M. Refined dnase-seq protocol and data analysis reveals intrinsic bias in transcription factor footprint identification . Nature Methods. 2014;11(1):73–78. - PMC - PubMed
    1. Smith TF, Waterman MS. Identification of common molecular subsequences . J Mol Biol. 1981;147(1):195–197. - PubMed
    1. Martin M. Cutadapt removes adapter sequences from high-throughput sequencing reads . EMBnet.journal. 2011;17:10–12.
    1. Ukkonen E. Finding approximate patterns in strings . J Algorithm. 1985;6(1):132–137.
    1. Myers G. A fast bit-vector algorithm for approximate string matching based on dynamic programming . J ACM. 1999;46(3):395–415.

Publication types