Jens Stoye

Jens Stoye

Auto-generated profile, based on publicly available information

Jens Stoye

Bielefeld University, Bielefeld, Germany

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 May 2011 in Nucleic Acids Research
Verified
Journal Article
Open access
PDF file
WGWolfgang Gerlach
Wolfgang Gerlach
JSJens Stoye
Jens Stoye
The vast majority of microbes are unculturable and thus cannot be sequenced by means of traditional methods. High-throughput sequencing techniques like 454 or Solexa-Illumina make it possible to explore those microbes by studying whole natural microbial communities and analysing their biological diversity as well as the underlying metabolic pathways. Over the past few years, different methods have been developed for the taxonomic and functional characterization of metagenomic shotgun sequences. However, the taxonomic classification of metagenomic sequences from novel species without close homologue in the biological sequence databases poses a challenge due to the high number of wrong taxonomic predictions on lower taxonomic ranks. Here we present CARMA3, a new method for the taxonomic classification of assembled and unassembled metagenomic sequences that has been adapted to work with both BLAST and HMMER3 homology searches. We show that our method makes fewer wrong taxonomic predictions (at the same sensitivity) than other BLAST-based methods. CARMA3 is freely accessible via the web application WebCARMA from http://webcarma.cebitec.uni-bielefeld.de.

30 April 2014 in Bioinformatics
Verified
Journal Article
Open access
PDF file
RHRolf Hilker
Rolf Hilker
KSKai Bernd Stadermann
Kai Bernd Stadermann
DDDaniel Doppmeier
Daniel Doppmeier
JKJörn Kalinowski
Jörn Kalinowski
JSJens Stoye
Jens Stoye
AGAlexander Goesmann
Alexander Goesmann
Motivation: Fast algorithms and well-arranged visualizations are required for the comprehensive analysis of the ever-growing size of genomic and transcriptomic next-generation sequencing data. Results: ReadXplorer is a software offering straightforward visualization and extensive analysis functions for genomic and transcriptomic DNA sequences mapped on a reference. A unique specialty of ReadXplorer is the quality classification of the read mappings. It is incorporated in all analysis functions and displayed in ReadXplorer's various synchronized data viewers for (i) the reference sequence, its base coverage as (ii) normalizable plot and (iii) histogram, (iv) read alignments and (v) read pairs. ReadXplorer's analysis capability covers RNA secondary structure prediction, single nucleotide polymorphism and deletion–insertion polymorphism detection, genomic feature and general coverage analysis. Especially for RNA-Seq data, it offers differential gene expression analysis, transcription start site and operon detection as well as RPKM value and read count calculations. Furthermore, ReadXplorer can combine or superimpose coverage of different datasets. Availability and implementation: ReadXplorer is available as open-source software at http://www.readxplorer.org along with a detailed manual. Contact:rhilker@mikrobio.med.uni-giessen.de Supplementary information: Supplementary Data are available at Bioinformatics online.

14 April 2016 in Algorithms for Molecular Biology
Verified
Journal Article
Open access
PDF file
GHGuillaume Holley
Guillaume Holley
RWRoland Wittler
Roland Wittler
JSJens Stoye
Jens Stoye
High throughput sequencing technologies have become fast and cheap in the past years. As a result, large-scale projects started to sequence tens to several thousands of genomes per species, producing a high number of sequences sampled from each genome. Such a highly redundant collection of very similar sequences is called a pan-genome. It can be transformed into a set of sequences “colored” by the genomes to which they belong. A colored de Bruijn graph (C-DBG) extracts from the sequences all colored k-mers, strings of length k, and stores them in vertices. In this paper, we present an alignment-free, reference-free and incremental data structure for storing a pan-genome as a C-DBG: the bloom filter trie (BFT). The data structure allows to store and compress a set of colored k-mers, and also to efficiently traverse the graph. Bloom filter trie was used to index and query different pangenome datasets. Compared to another state-of-the-art data structure, BFT was up to two times faster to build while using about the same amount of main memory. For querying k-mers, BFT was about 52–66 times faster while using about 5.5–14.3 times less memory. We present a novel succinct data structure called the Bloom Filter Trie for indexing a pan-genome as a colored de Bruijn graph. The trie stores k-mers and their colors based on a new representation of vertices that compress and index shared substrings. Vertices use basic data structures for lightweight substrings storage as well as Bloom filters for efficient trie and graph traversals. Experimental results prove better performance compared to another state-of-the-art data structure. https://www.github.com/GuillaumeHolley/BloomFilterTrie .

23 January 2019 in PLOS Pathogens
Verified
Journal Article
Open access
PDF file
HOHarald Oey
Harald Oey
MZMartha Zakrzewski
Martha Zakrzewski
KGKerstin Gravermann
Kerstin Gravermann
NYNeil Young
Neil Young
PKPasi Korhonen
Pasi Korhonen
LKLutz Krause
Lutz Krause
Mesenteric infection by the parasitic blood fluke Schistosoma bovis is a common veterinary problem in Africa and the Middle East and occasionally in the Mediterranean Region. The species also has the ability to form interspecific hybrids with the human parasite S. haematobium with natural hybridisation observed in West Africa, presenting possible zoonotic transmission. Additionally, this exchange of alleles between species may dramatically influence disease dynamics and parasite evolution. We have generated a 374 Mb assembly of the S. bovis genome using Illumina and PacBio-based technologies. Despite infecting different hosts and organs, the genome sequences of S. bovis and S. haematobium appeared strikingly similar with 97% sequence identity. The two species share 98% of protein-coding genes, with an average sequence identity of 97.3% at the amino acid level. Genome comparison identified large continuous parts of the genome (up to several 100 kb) showing almost 100% sequence identity between S. bovis and S. haematobium. It is unlikely that this is a result of genome conservation and provides further evidence of natural interspecific hybridization between S. bovis and S. haematobium. Our results suggest that foreign DNA obtained by interspecific hybridization was maintained in the population through multiple meiosis cycles and that hybrids were sexually reproductive, producing viable offspring. The S. bovis genome assembly forms a highly valuable resource for studying schistosome evolution and exploring genetic regions that are associated with species-specific phenotypic traits. In this article we detail the assembly and functional annotation of the Schistosoma bovis genome. S. bovis is a parasitic flatworm that primarily infects bovines, with important economic consequences in affected countries. However, it is also a close relative of the human carcinogenic parasite Schistosoma haematobium which is a serious health issue in many endemic countries in Sub-Saharan Africa. The close relationship and overlapping geographical distribution of S. bovis and S. haematobium allows these to hybridise in the wild increasing their genetic diversity and presenting the risk of zoonotic transmission, i.e. the transmission from animals to humans. The hybridization between human and ruminant schistosomes is of particular interest as interspecific hybridization may have dramatic impacts on transmission rates, disease dynamics, control interventions and parasite evolution. By whole-genome sequencing and comparative genomics we present evidence that fertile hybrids are indeed present in the wild, presenting the potential risk of transmission from animal reservoirs to humans.

14 October 2024 in Microbial Genomics
Verified
Journal Article
Open access
DFDaria Frolova
Daria Frolova
LLLeandro Lima
Leandro Lima
LRLeah Wendy Roberts
Leah Wendy Roberts
LBLeonard Bohnenkämper
Leonard Bohnenkämper
RWRoland Wittler
Roland Wittler
ZIZamin Iqbal
Zamin Iqbal
Plasmids are a key vector of antibiotic resistance, but the current bioinformatics toolkit is not well suited to tracking them. The rapid structural changes seen in plasmid genomes present considerable challenges to evolutionary and epidemiological analysis. Typical approaches are either low resolution (replicon typing) or use shared k-mer content to define a genetic distance. However, this distance can both overestimate plasmid relatedness by ignoring rearrangements, and underestimate by over-penalizing gene gain/loss. Therefore a model is needed which captures the key components of how plasmid genomes evolve structurally – through gene/block gain or loss, and rearrangement. A secondary requirement is to prevent promiscuous transposable elements (TEs) leading to over-clustering of unrelated plasmids. We choose the ‘Double Cut and Join Indel’ (DCJ-Indel) model, in which plasmids are studied at a coarse level, as a sequence of signed integers (representing genes or aligned blocks), and the distance between two plasmids is the minimum number of rearrangement events or indels needed to transform one into the other. We show how this gives much more meaningful distances between plasmids. We introduce a software workflow pling (https://github.com/iqbal-lab-org/pling), which uses the DCJ-Indel model, to calculate distances between plasmids and then cluster them. In our approach, we combine containment distances and DCJ-Indel distances to build a TE-aware plasmid network. We demonstrate superior performance and interpretability to other plasmid clustering tools on the ‘Russian Doll’ dataset and a hospital transmission dataset.

1 August 2020 in iScience
Verified
Journal Article
Open access
EHEhsan Haghshenas
Ehsan Haghshenas
HAHossein Asghari
Hossein Asghari
JSJens Stoye
Jens Stoye
CCCedric Chauve
Cedric Chauve
FHFaraz Hach
Faraz Hach
Third-generation sequencing technologies from companies such as Oxford Nanopore and Pacific Biosciences have paved the way for building more contiguous and potentially gap-free assemblies. The larger effective length of their reads has provided a means to overcome the challenges of short to mid-range repeats. Currently, accurate long read assemblers are computationally expensive, whereas faster methods are not as accurate. Moreover, despite recent advances in third-generation sequencing, researchers still tend to generate accurate short reads for many of the analysis tasks. Here, we present HASLR, a hybrid assembler that uses error-prone long reads together with high-quality short reads to efficiently generate accurate genome assemblies. Our experiments show that HASLR is not only the fastest assembler but also the one with the lowest number of misassemblies on most of the samples, while being on par with other assemblers in terms of contiguity and accuracy.