PEAT: An intelligent and efficient paired-end sequencing adapter trimming algorithm

Yun Lung Li, Jui Cheng Weng, Chiung Chih Hsiao, Min Te Chou, Chin Wen Tseng, Jui-Hung Hung*

*此作品的通信作者

研究成果: Article同行評審

34 引文 斯高帕斯(Scopus)

摘要

Background: In modern paired-end sequencing protocols short DNA fragments lead to adapter-appended reads. Current paired-end adapter removal approaches trim adapter by scanning the fragment of adapter on the 3' end of the reads, which are not competent in some applications. Results: Here, we propose a fast and highly accurate adapter-trimming algorithm, PEAT, designed specifically for paired-end sequencing. PEAT requires no adaptor sequence, which is convenient for large-scale meta-analyses. We assessed the performance of PEAT with many adapter trimmers in both simulated and real life paired-end sequencing libraries. The importance of adapter trimming was exemplified by the influence of the downstream analyses on RNA-seq, ChIP-seq and MNase-seq. Several useful guidelines of applying adapter trimmers with aligners were suggested. Conclusions: PEAT can be easily included in the routine paired-end sequencing pipeline. The executable binaries and the standalone C++ source code package of PEAT are freely available online.

原文English
文章編號S2
期刊BMC Bioinformatics
16
發行號1
DOIs
出版狀態Published - 21 一月 2015

指紋

深入研究「PEAT: An intelligent and efficient paired-end sequencing adapter trimming algorithm」主題。共同形成了獨特的指紋。

引用此