Measuring reproducibility of virus metagenomics analyses using bootstrap samples from FASTQ-files

2020 ◽  
Author(s):  
Babak Saremi ◽  
Moritz Kohls ◽  
Pamela Liebig ◽  
Ursula Siebert ◽  
Klaus Jung
Keyword(s):  
Mixture Model ◽  
High Throughput Sequencing ◽  
Supplementary Information ◽  
Sequencing Data ◽  
Bootstrap Sampling ◽  
Technical Errors ◽  
High Throughput Sequencing Data ◽  
The Difference ◽  
Real World Datasets ◽  
Highly Correlated

Abstract Motivation High-throughput sequencing data can be affected by different technical errors, e.g. from probe preparation or false base calling. As a consequence, reproducibility of experiments can be weakened. In virus metagenomics, technical errors can result in falsely identified viruses in samples from infected hosts. We present a new resampling approach based on bootstrap sampling of sequencing reads from FASTQ-files in order to generate artificial replicates of sequencing runs which can help to judge the robustness of an analysis. In addition, we evaluate a mixture model on the distribution of read counts per virus to identify potentially false positive findings. Results The evaluation of our approach on an artificially generated dataset with known viral sequence content shows in general a high reproducibility of uncovering viruses in sequencing data, i.e. the correlation between original and mean bootstrap read count was highly correlated. However, the bootstrap read counts can also indicate reduced or increased evidence for the presence of a virus in the biological sample. We also found that the mixture-model fits well to the read counts, and furthermore, it provides a higher accuracy on the original or on the bootstrap read counts than on the difference between both. The usefulness of our methods is further demonstrated on two freely available real-world datasets from harbor seals. Availability and implementation We provide a Phyton tool, called RESEQ, available from https://github.com/babaksaremi/RESEQ that allows efficient generation of bootstrap reads from an original FASTQ-file. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals circtools—a one-stop software solution for circular RNA research

2018 ◽  
Vol 35 (13) ◽  
pp. 2326-2328 ◽  
Author(s):  
Tobias Jakobi ◽  
Alexey Uvarovskii ◽  
Christoph Dieterich
Keyword(s):  
High Throughput Sequencing ◽  
Circular Rna ◽  
Statistical Testing ◽  
Supplementary Information ◽  
Circular Rnas ◽  
Sequencing Data ◽  
High Throughput Sequencing Data ◽  
Multi Stage ◽  
Sequence Reconstruction ◽  
One Stop

Abstract Motivation Circular RNAs (circRNAs) originate through back-splicing events from linear primary transcripts, are resistant to exonucleases, are not polyadenylated and have been shown to be highly specific for cell type and developmental stage. CircRNA detection starts from high-throughput sequencing data and is a multi-stage bioinformatics process yielding sets of potential circRNA candidates that require further analyses. While a number of tools for the prediction process already exist, publicly available analysis tools for further characterization are rare. Our work provides researchers with a harmonized workflow that covers different stages of in silico circRNA analyses, from prediction to first functional insights. Results Here, we present circtools, a modular, Python-based framework for computational circRNA analyses. The software includes modules for circRNA detection, internal sequence reconstruction, quality checking, statistical testing, screening for enrichment of RBP binding sites, differential exon RNase R resistance and circRNA-specific primer design. circtools supports researchers with visualization options and data export into commonly used formats. Availability and implementation circtools is available via https://github.com/dieterich-lab/circtools and http://circ.tools under GPLv3.0. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals hypeR: An R Package for Geneset Enrichment Workflows

2019 ◽  
Author(s):  
Anthony Federico ◽  
Stefano Monti
Keyword(s):  
High Throughput Sequencing ◽  
R Package ◽  
Supplementary Information ◽  
Sequencing Data ◽  
Wide Audience ◽  
Popular Method ◽  
Link Type ◽  
High Throughput Sequencing Data ◽  
One Stop ◽  
Recent Version

ABSTRACTSummaryGeneset enrichment is a popular method for annotating high-throughput sequencing data. Existing tools fall short in providing the flexibility to tackle the varied challenges researchers face in such analyses, particularly when analyzing many signatures across multiple experiments. We present a comprehensive R package for geneset enrichment workflows that offers multiple enrichment, visualization, and sharing methods in addition to novel features such as hierarchical geneset analysis and built-in markdown reporting. hypeR is a one-stop solution to performing geneset enrichment for a wide audience and range of use cases.Availability and implementationThe most recent version of the package is available at https://github.com/montilab/hypeR.Supplementary informationComprehensive documentation and tutorials, are available at https://montilab.github.io/hypeR-docs.

ADFinder: accurate detection of programmed DNA elimination using NGS high-throughput sequencing data

2020 ◽  
Vol 36 (12) ◽  
pp. 3632-3636 ◽  
Author(s):  
Weibo Zheng ◽  
Jing Chen ◽  
Thomas G Doak ◽  
Weibo Song ◽  
Ying Yan
Keyword(s):  
High Throughput ◽  
Large Scale ◽  
High Throughput Sequencing ◽  
Supplementary Information ◽  
Sequencing Data ◽  
Source Codes ◽  
High Throughput Sequencing Data ◽  
Dna Elimination ◽  
Multiple Alternative ◽  
Dna Splicing

Abstract Motivation Programmed DNA elimination (PDE) plays a crucial role in the transitions between germline and somatic genomes in diverse organisms ranging from unicellular ciliates to multicellular nematodes. However, software specific for the detection of DNA splicing events is scarce. In this paper, we describe Accurate Deletion Finder (ADFinder), an efficient detector of PDEs using high-throughput sequencing data. ADFinder can predict PDEs with relatively low sequencing coverage, detect multiple alternative splicing forms in the same genomic location and calculate the frequency for each splicing event. This software will facilitate research of PDEs and all down-stream analyses. Results By analyzing genome-wide DNA splicing events in two micronuclear genomes of Oxytricha trifallax and Tetrahymena thermophila, we prove that ADFinder is effective in predicting large scale PDEs. Availability and implementation The source codes and manual of ADFinder are available in our GitHub website: https://github.com/weibozheng/ADFinder. Supplementary information Supplementary data are available at Bioinformatics online.

Inference of viral quasispecies with a paired de Bruijn graph

2020 ◽  
Author(s):  
Borja Freire ◽  
Susana Ladra ◽  
Jose R Paramá ◽  
Leena Salmela
Keyword(s):  
High Throughput Sequencing ◽  
De Novo ◽  
Supplementary Information ◽  
De Bruijn Graph ◽  
Viral Quasispecies ◽  
Sequencing Data ◽  
De Bruijn Graphs ◽  
Sequencing Errors ◽  
High Throughput Sequencing Data ◽  
De Bruijn

Abstract Motivation RNA viruses exhibit a high mutation rate and thus they exist in infected cells as a population of closely related strains called viral quasispecies. The viral quasispecies assembly problem asks to characterize the quasispecies present in a sample from high-throughput sequencing data. We study the de novo version of the problem, where reference sequences of the quasispecies are not available. Current methods for assembling viral quasispecies are either based on overlap graphs or on de Bruijn graphs. Overlap graph-based methods tend to be accurate but slow, whereas de Bruijn graph-based methods are fast but less accurate. Results We present viaDBG, which is a fast and accurate de Bruijn graph-based tool for de novo assembly of viral quasispecies. We first iteratively correct sequencing errors in the reads, which allows us to use large k-mers in the de Bruijn graph. To incorporate the paired-end information in the graph, we also adapt the paired de Bruijn graph for viral quasispecies assembly. These features enable the use of long-range information in contig construction without compromising the speed of de Bruijn graph-based approaches. Our experimental results show that viaDBG is both accurate and fast, whereas previous methods are either fast or accurate but not both. In particular, viaDBG has comparable or better accuracy than SAVAGE, while being at least nine times faster. Furthermore, the speed of viaDBG is comparable to PEHaplo but viaDBG is able to retrieve also low abundance quasispecies, which are often missed by PEHaplo. Availability and implementation viaDBG is implemented in C++ and it is publicly available at https://bitbucket.org/bfreirec1/viadbg. All datasets used in this article are publicly available at https://bitbucket.org/bfreirec1/data-viadbg/. Supplementary information Supplementary data are available at Bioinformatics online.

MitoFlex: an efficient, high-performance toolkit for animal mitogenome assembly, annotation, and visualization

2021 ◽  
Author(s):  
Jun-Yu Li ◽  
Wei-Xuan Li ◽  
An-Tai Wang ◽  
Zhang Yu
Keyword(s):  
Mitochondrial Genome ◽  
High Performance ◽  
High Throughput Sequencing ◽  
De Novo ◽  
Supplementary Information ◽  
Sequencing Data ◽  
Protein Coding ◽  
High Throughput Sequencing Data ◽  
Genome Analysis Toolkit ◽  
Overall Performance

Abstract Summary MitoFlex is a linux-based mitochondrial genome analysis toolkit, which provides a complete workflow of raw data filtering, de novo assembly, mitochondrial genome identification and annotation for animal high throughput sequencing data. The overall performance was compared between MitoFlex and its analogue MitoZ, in terms of protein coding gene recovery, memory consumption and processing speed. Availability MitoFlex is available at https://github.com/Prunoideae/MitoFlex under GPLv3 license. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals OGRE: Overlap Graph-based metagenomic Read clustEring

2020 ◽  
Author(s):  
Marleen Balvert ◽  
Xiao Luo ◽  
Ernestina Hauptfeld ◽  
Alexander Schönhuth ◽  
Bas E Dutilh
Keyword(s):  
High Throughput ◽  
High Throughput Sequencing ◽  
Computation Time ◽  
Supplementary Information ◽  
Sequencing Data ◽  
High Throughput Sequencing Data ◽  
Computationally Intensive ◽  
Metagenome Sequencing ◽  
Species Specific ◽  
Cluster Purity

Abstract Motivation The microbes that live in an environment can be identified from the combined genomic material, also referred to as the metagenome. Sequencing a metagenome can result in large volumes of sequencing reads. A promising approach to reduce the size of metagenomic datasets is by clustering reads into groups based on their overlaps. Clustering reads are valuable to facilitate downstream analyses, including computationally intensive strain-aware assembly. As current read clustering approaches cannot handle the large datasets arising from high-throughput metagenome sequencing, a novel read clustering approach is needed. In this article, we propose OGRE, an Overlap Graph-based Read clustEring procedure for high-throughput sequencing data, with a focus on shotgun metagenomes. Results We show that for small datasets OGRE outperforms other read binners in terms of the number of species included in a cluster, also referred to as cluster purity, and the fraction of all reads that is placed in one of the clusters. Furthermore, OGRE is able to process metagenomic datasets that are too large for other read binners into clusters with high cluster purity. Conclusion OGRE is the only method that can successfully cluster reads in species-specific clusters for large metagenomic datasets without running into computation time- or memory issues. Availabilityand implementation Code is made available on Github (https://github.com/Marleen1/OGRE). Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals NetCoMi: network construction and comparison for microbiome data in R

2020 ◽  
Author(s):  
Stefanie Peschel ◽  
Christian L Müller ◽  
Erika von Mutius ◽  
Anne-Laure Boulesteix ◽  
Martin Depner
Keyword(s):  
High Throughput ◽  
High Throughput Sequencing ◽  
Supplementary Information ◽  
Supplementary Data ◽  
Sequencing Data ◽  
Network Construction ◽  
Microbial Association ◽  
High Throughput Sequencing Data ◽  
Microbial Associations ◽  
Microbiome Data

Abstract Motivation Estimating microbial association networks from high-throughput sequencing data is a common exploratory data analysis approach aiming at understanding the complex interplay of microbial communities in their natural habitat. Statistical network estimation workflows comprise several analysis steps, including methods for zero handling, data normalization and computing microbial associations. Since microbial interactions are likely to change between conditions, e.g. between healthy individuals and patients, identifying network differences between groups is often an integral secondary analysis step. Thus far, however, no unifying computational tool is available that facilitates the whole analysis workflow of constructing, analysing and comparing microbial association networks from high-throughput sequencing data. Results Here, we introduce NetCoMi (Network Construction and comparison for Microbiome data), an R package that integrates existing methods for each analysis step in a single reproducible computational workflow. The package offers functionality for constructing and analysing single microbial association networks as well as quantifying network differences. This enables insights into whether single taxa, groups of taxa or the overall network structure change between groups. NetCoMi also contains functionality for constructing differential networks, thus allowing to assess whether single pairs of taxa are differentially associated between two groups. Furthermore, NetCoMi facilitates the construction and analysis of dissimilarity networks of microbiome samples, enabling a high-level graphical summary of the heterogeneity of an entire microbiome sample collection. We illustrate NetCoMi’s wide applicability using data sets from the GABRIELA study to compare microbial associations in settled dust from children’s rooms between samples from two study centers (Ulm and Munich). Availability R scripts used for producing the examples shown in this manuscript are provided as supplementary data. The NetCoMi package, together with a tutorial, is available at https://github.com/stefpeschel/NetCoMi. Contact Tel:+49 89 3187 43258; [email protected] Supplementary information Supplementary data are available at Briefings in Bioinformatics online.

scholarly journals Succinct Dynamic de Bruijn Graphs

2020 ◽  
Author(s):  
Bahar Alipanahi ◽  
Alan Kuhnle ◽  
Simon J Puglisi ◽  
Leena Salmela ◽  
Christina Boucher
Keyword(s):  
Data Structures ◽  
Large Scale ◽  
High Throughput Sequencing ◽  
Supplementary Information ◽  
De Bruijn Graph ◽  
Sequencing Data ◽  
Efficient Manner ◽  
De Bruijn Graphs ◽  
High Throughput Sequencing Data ◽  
De Bruijn

Abstract Motivation The de Bruijn graph is one of the fundamental data structures for analysis of high throughput sequencing data. In order to be applicable to population-scale studies, it is essential to build and store the graph in a space- and time- efficient manner. In addition, due to the ever-changing nature of population studies, it has become essential to update the graph after construction e.g. add and remove nodes and edges. Although there has been substantial effort on making the construction and storage of the graph efficient, there is a limited amount of work in building the graph in an efficient and mutable manner. Hence, most space efficient data structures require complete reconstruction of the graph in order to add or remove edges or nodes. Results In this paper we present DynamicBOSS, a succinct representation of the de Bruijn graph that allows for an unlimited number of additions and deletions of nodes and edges. We compare our method with other competing methods and demonstrate that DynamicBOSS is the only method that supports both addition and deletion and is applicable to very large samples (e.g. greater than 15 billion k-mers). Competing dynamic methods e.g., FDBG (Crawford et al., 2018) cannot be constructed on large scale datasets, or cannot support both addition and deletion e.g., BiFrost (Holley and Melsted, 2019). Availability DynamicBOSS is publicly available at https://github.com/baharpan/dynboss. Supplementary information Supplementary data are available at Bioinformatics online.

scholarly journals Direct Superbubble Detection

Algorithms ◽  
2019 ◽  
Vol 12 (4) ◽  
pp. 81 ◽  
Author(s):  
Fabian Gärtner ◽  
Peter F. Stadler
Keyword(s):  
High Throughput Sequencing ◽  
Linear Time ◽  
Time Algorithm ◽  
Connected Components ◽  
Exit Point ◽  
Sequencing Data ◽  
Depth First Search ◽  
High Throughput Sequencing Data ◽  
Strongly Connected ◽  
Real World Datasets

Superbubbles are a class of induced subgraphs in digraphs that play an essential role in assembly algorithms for high-throughput sequencing data. They are connected with the remainder of the host digraph by a single entrance and a single exit vertex. Linear-time algorithms for the enumeration superbubbles recently have become available. Current approaches require the decomposition of the input digraph into strongly-connected components, which are then analyzed separately. In principle, a single depth-first search could be used, provided one can guarantee that the root of the depth-first search (DFS)-tree is not itself located in the interior or the exit point of a superbubble. Here, we describe a linear-time algorithm to determine suitable roots for a DFS-forest that is guaranteed to identify the superbubbles in a digraph correctly. In addition to the advantages of a more straightforward implementation, we observe a nearly three-fold gain in performance on real-world datasets. We present a reference implementation of the new algorithm that accepts many commonly-used input formats for digraphs. It is available as open source from github.

scholarly journals SomVarIUS: somatic variant identification from unpaired tissue samples

2015 ◽  
Vol 32 (6) ◽  
pp. 808-813 ◽  
Author(s):  
Kyle S. Smith ◽  
Vinod K. Yadav ◽  
Shanshan Pei ◽  
Daniel A. Pollyea ◽  
Craig T. Jordan ◽  
...  
Keyword(s):  
High Throughput Sequencing ◽  
Variant Calling ◽  
Computational Method ◽  
Supplementary Information ◽  
Sequencing Data ◽  
Somatic Variant ◽  
Tissue Samples ◽  
Normal Tissues ◽  
High Throughput Sequencing Data ◽  
Oncogenic Mutations

Abstract Motivation: Somatic variant calling typically requires paired tumor-normal tissue samples. Yet, paired normal tissues are not always available in clinical settings or for archival samples. Results: We present SomVarIUS, a computational method for detecting somatic variants using high throughput sequencing data from unpaired tissue samples. We evaluate the performance of the method using genomic data from synthetic and real tumor samples. SomVarIUS identifies somatic variants in exome-seq data of  ∼150 ×  coverage with at least 67.7% precision and 64.6% recall rates, when compared with paired-tissue somatic variant calls in real tumor samples. We demonstrate the utility of SomVarIUS by identifying somatic mutations in formalin-fixed samples, and tracking clonal dynamics of oncogenic mutations in targeted deep sequencing data from pre- and post-treatment leukemia samples. Availability and implementation: SomVarIUS is written in Python 2.7 and available at http://www.sjdlab.org/resources/ Contact: [email protected] Supplementary information: Supplementary data are available at Bioinformatics online.

Sign in / Sign up

Export Citation Format

Share Document