Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Korbinian Schneeberger

dblp:31/2354 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
1since 2021 · last 2022
0000-0002-5512-0443ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Applied, interdisciplinary, general and emerging computing · 5 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Interdisciplinary, comprehensive, and emerging computing
3 papers
Bioinformatics and computational biology · 100%

Topics — the 7 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › comparative genomics
genome rearrangement
0.612022
plotsr: visualizing structural similarities and rearrangements between multiple genomes · Bioinform. 2022
Bioinformatics and computational biology › genomics
genome visualization
0.612022
plotsr: visualizing structural similarities and rearrangements between multiple genomes · Bioinform. 2022
Bioinformatics and computational biology › genomics › genome analysis
genome size estimation
0.312018
findGSE: estimating genome size variation within human and Arabidopsis using k-mer frequencies · Bioinform. 2018
Bioinformatics and computational biology › population genetics
population genomics
0.112018
findGSE: estimating genome size variation within human and Arabidopsis using k-mer frequencies · Bioinform. 2018
Bioinformatics and computational biology › genome annotation
repeat masking
0.112006
RBR: library-less repeat detection for ESTs · Bioinform. 2006
Bioinformatics and computational biology › sequence analysis
sequence clustering
0.112006
RBR: library-less repeat detection for ESTs · Bioinform. 2006
Bioinformatics and computational biology › transcriptomics
expressed sequence tag analysis
0.012006
RBR: library-less repeat detection for ESTs · Bioinform. 2006

Methods — techniques the papers use, named apart from their topics

matplotlib · 0.6skew normal distribution fitting · 0.3match statistics · 0.1
YearPublicationVenuePosition
2022 plotsr: visualizing structural similarities and rearrangements between multiple genomes
abstract
SUMMARY: Third-generation genome sequencing technologies have led to a sharp increase in the number of high-quality genome assemblies. This allows the comparison of multiple assembled genomes of individual species and demands new tools for visualizing their structural properties. Here, we present plotsr, an efficient tool to visualize structural similarities and rearrangements between genomes. It can be used to compare genomes on chromosome level or to zoom in on any selected region. In addition, plotsr can augment the visualization with regional identifiers (e.g. genes or genomic markers) or histogram tracks for continuous features (e.g. GC content or polymorphism density). AVAILABILITY AND IMPLEMENTATION: plotsr is implemented as a python package and uses the standard matplotlib library for plotting. It is freely available under the MIT license at GitHub (https://github.com/schneebergerlab/plotsr) and bioconda (https://anaconda.org/bioconda/plotsr). SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Manish Goel, Korbinian Schneeberger
Bioinform.2
2020 The Longest Run Subsequence Problem
abstract
Genome assembly is one of the most important problems in computational genomics. Here, we suggest addressing the scaffolding phase, in which contigs need to be linked and ordered to obtain larger pseudo-chromosomes, by means of a second incomplete assembly of a related species. The idea is to use alignments of binned regions in one contig to find the most homologous contig in the other assembly. We show that ordering the contigs of the other assembly can be expressed by a new string problem, the longest run subsequence problem (LRS). We show that LRS is NP-hard and present reduction rules and two algorithmic approaches that, together, are able to solve large instances of LRS to provable optimality. In particular, they can solve realistic instances resulting from partial Arabidopsis thaliana assemblies in short computation time. Our source code and all data used in the experiments are freely available.
Sven Schrinner, Manish Goel, Michael Wulfert, Philipp Spohr, Korbinian Schneeberger, Gunnar W. Klau
WABI5
2018 findGSE: estimating genome size variation within human and Arabidopsis using k-mer frequencies
abstract
Motivation: Analyzing k-mer frequencies in whole-genome sequencing data is becoming a common method for estimating genome size (GS). However, it remains uninvestigated how accurate the method is, especially if it can capture intra-species GS variation. Results: We present findGSE, which fits skew normal distributions to k-mer frequencies to estimate GS. findGSE outperformed existing tools in an extensive simulation study. Estimating GSs of 89 Arabidopsis thaliana accessions, findGSE showed the highest capability in capturing GS variations. In an application with 71 female and 71 male human individuals, findGSE delivered an average of 3039 Mb as haploid human GS, while female genomes were on average 41 Mb larger than male genomes, in astonishing agreement with size difference of the X and Y chromosomes. Further analysis showed that human GS variations link to geographical patterns and significant differences between populations, which can be explained by variable abundances of LINE-1 retrotransposons. Availability and implementation: R package of findGSE is freely available at https://github.com/schneebergerlab/findGSE and supported on linux and Mac systems. Contact: [email protected]. Supplementary information: Supplementary data are available at Bioinformatics online.
Hequan Sun, Jia Ding, Mathieu Piednoël, Korbinian Schneeberger
Bioinform.4
2008 Optimal spliced alignments of short sequence reads
Fabio De Bona, Stephan Ossowski, Korbinian Schneeberger, Gunnar Rätsch
BMC Bioinform.3
2006 RBR: library-less repeat detection for ESTs
abstract
MOTIVATION: Repeat sequences in ESTs are a source of problems, in particular for clustering. ESTs are therefore commonly masked against a library of known repeats. High quality repeat libraries are available for the widely studied organisms, but for most other organisms the lack of such libraries is likely to compromise the quality of EST analysis. RESULTS: We present a fast, flexible and library-less method for masking repeats in EST sequences, based on match statistics within the EST collection. The method is not linked to a particular clustering algorithm. Extensive testing on datasets using different clustering methods and a genomic mapping as reference shows that this method gives results that are better than or as good as those obtained using RepeatMasker with a repeat library. AVAILABILITY: The implementation of RBR is available under the terms of the GPL from http://www.ii.uib.no/~ketil/bioinformatics CONTACT: [email protected] SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Ketil Malde, Korbinian Schneeberger, Eivind Coward, Inge Jonassen
Bioinform.2