Q-nexus: a comprehensive and efficient analysis pipeline designed for ChIP-nexus.
ChIP-nexus, an extension of the ChIP-exo protocol, can be used to map the borders of protein-bound DNA sequences at nucleotide resolution, requires less input DNA and enables selective PCR duplicate removal using random barcodes. However, the use of random barcodes requires additional preprocessing of the mapping data, which complicates the computational analysis. To date, only a very limited number of software packages are available for the analysis of ChIP-exo data, which have not yet been systematically tested and compared on ChIP-nexus data.



Here, we present a comprehensive software package for ChIP-nexus data that exploits the random barcodes for selective removal of PCR duplicates and for quality control. Furthermore, we developed bespoke methods to estimate the width of the protected region resulting from protein-DNA binding and to infer binding positions from ChIP-nexus data. Finally, we applied our peak calling method as well as the two other methods MACE and MACS2 to the available ChIP-nexus data.



The Q-nexus software is efficient and easy to use. Novel statistics about duplication rates in consideration of random barcodes are calculated. Our method for the estimation of the width of the protected region yields unbiased signatures that are highly reproducible for biological replicates and at the same time very specific for the respective factors analyzed. As judged by the irreproducible discovery rate (IDR), our peak calling algorithm shows a substantially better reproducibility. An implementation of Q-nexus is available at http://charite.github.io/Q/ .
Institute for Medical and Human Genetics, Charité-Universitätsmedizin Berlin, Augustenburger Platz 1, Berlin, 13353, Germany.|Berlin Brandenburg Center for Regenerative Therapies (BCRT), Charité-Universitätsmedizin Berlin, Augustenburger Platz 1, Berlin, 13353, Germany.
Peter
P
Hansen
Centre for Genomic Regulation (CRG), The Barcelona Institute of Science and Technology, Dr. Aiguader 88, Barcelona, 08003, Spain.|Universitat Pompeu Fabra (UPF), Barcelona, Spain.
Jochen
J
Hecht
Faculty of Biology, Johannes Gutenberg University Mainz, Ackermannweg 4, Mainz, 55128, Germany.|Institute of Molecular Biology, Ackermannweg 4, Mainz, 55128, Germany.
Jonas
J
Ibn-Salem
Institute for Medical and Human Genetics, Charité-Universitätsmedizin Berlin, Augustenburger Platz 1, Berlin, 13353, Germany.
Benjamin S
BS
Menkuec
Institute for Bioinformatics, Department of Mathematics and Computer Science, Freie Universität Berlin, Arnimallee 14, Berlin, 14195, Germany.
Sebastian
S
Roskosch
Labor für Pädiatrische Molekularbiologie, Charité-Universitätsmedizin Berlin, Augustenburger Platz 1, Berlin, 13353, Germany.
Matthias
M
Truss
Institute for Medical and Human Genetics, Charité-Universitätsmedizin Berlin, Augustenburger Platz 1, Berlin, 13353, Germany. peter.robinson@jax.org.|Berlin Brandenburg Center for Regenerative Therapies (BCRT), Charité-Universitätsmedizin Berlin, Augustenburger Platz 1, Berlin, 13353, Germany. peter.robinson@jax.org.|Institute for Bioinformatics, Department of Mathematics and Computer Science, Freie Universität Berlin, Arnimallee 14, Berlin, 14195, Germany. peter.robinson@jax.org.|Max Planck Institute for Molecular Genetics, Inhestr. 63-73, Berlin, 14195, Germany. peter.robinson@jax.org.|Current address: The Jackson Laboratory for Genomic Medicine, 10 Discovery Drive, Farmington, 06032, CT, USA. peter.robinson@jax.org.
Peter N
PN
Robinson
D000465:Algorithms; D001665:Binding Sites; D047369:Chromatin Immunoprecipitation; D019295:Computational Biology / Q000379:methods*; D004268:DNA-Binding Proteins / Q000378:metabolism; D059014:High-Throughput Nucleotide Sequencing; D059372:Nucleotide Motifs; D011485:Protein Binding; D015203:Reproducibility of Results; D012984:Software; D014157:Transcription Factors / Q000378:metabolism
D004268:DNA-Binding Proteins; D014157:Transcription Factors
Algorithm; Bioinformatics; ChIP-exo; ChIP-nexus; Chromatin immunoprecipitation; Duplication rates; Library complexity