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

Joachim Wolff

dblp:235/8557 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
4since 2021 · last 2021
0000-0001-9985-955XORCID · corroborated

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

Applied, interdisciplinary, general and emerging computing · 4 · 3 first-author · 4 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 · 95% Computational science and engineering · 5%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology
genomics
1.022021
Robust and efficient single-cell Hi-C clustering with approximate k-nearest neighbor graphs · Bioinform. 2021
Scool: a new data storage format for single-cell Hi-C data · Bioinform. 2021
Bioinformatics and computational biology › epigenomics
hi-c data analysis
1.022021
Robust and efficient single-cell Hi-C clustering with approximate k-nearest neighbor graphs · Bioinform. 2021
Scool: a new data storage format for single-cell Hi-C data · Bioinform. 2021
Bioinformatics and computational biology › genomics
genome visualization
0.512021
pyGenomeTracks: reproducible plots for multivariate genomic datasets · Bioinform. 2021
Bioinformatics and computational biology
chromosome conformation capture
0.322021
Robust and efficient single-cell Hi-C clustering with approximate k-nearest neighbor graphs · Bioinform. 2021
Scool: a new data storage format for single-cell Hi-C data · Bioinform. 2021
Computational science and engineering › computational reproducibility
reproducible data analysis
0.112021
pyGenomeTracks: reproducible plots for multivariate genomic datasets · Bioinform. 2021

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

modular plotting · 0.5locality-sensitive hashing · 0.5cooler file format · 0.5command-line interface · 0.5approximate nearest neighbors · 0.5
YearPublicationVenuePosition
2021 pyGenomeTracks: reproducible plots for multivariate genomic datasets
abstract
MOTIVATION: Generating publication ready plots to display multiple genomic tracks can pose a serious challenge. Making desirable and accurate figures requires considerable effort. This is usually done by hand or using a vector graphic software. RESULTS: pyGenomeTracks (PGT) is a modular plotting tool that easily combines multiple tracks. It enables a reproducible and standardized generation of highly customizable and publication ready images. AVAILABILITY AND IMPLEMENTATION: PGT is available through a graphical interface on https://usegalaxy.eu and through the command line. It is provided on conda via the bioconda channel, on pip and it is openly developed on github: https://github.com/deeptools/pyGenomeTracks. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Lucille Lopez-Delisle, Leily Rabbani, Joachim Wolff, Vivek Bhardwaj 0002, Rolf Backofen, Björn A. Grüning, Fidel Ramírez, Thomas Manke
Bioinform.3
2021 Scool: a new data storage format for single-cell Hi-C data
abstract
Bioinformatics (2020) doi: 10.1093/bioinformatics/btaa924 In the originally published version of this manuscript, requested author amendments to Figure 1. were inadvertently omitted prior to publishing. This error has now been corrected.
Joachim Wolff, Nezar Abdennur, Rolf Backofen, Björn A. Grüning
Bioinform.1
2021 Scool: a new data storage format for single-cell Hi-C data
abstract
MOTIVATION: Single-cell Hi-C research currently lacks an efficient, easy to use and shareable data storage format. Recent studies have used a variety of sub-optimal solutions: publishing raw data only, text-based interaction matrices, or reusing established Hi-C storage formats for single interaction matrices. These approaches are storage and pre-processing intensive, require long labour time and are often error-prone. RESULTS: The single-cell cooler file format (scool) provides an efficient, user-friendly and storage-saving approach for single-cell Hi-C data. It is a flavour of the established cooler format and guarantees stable API support. AVAILABILITY AND IMPLEMENTATION: The single-cell cooler format is part of the cooler file format as of API version 0.8.9. It is available via pip, conda and github: https://github.com/mirnylab/cooler. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Joachim Wolff, Nezar Abdennur, Rolf Backofen, Björn A. Grüning
Bioinform.1
2021 Robust and efficient single-cell Hi-C clustering with approximate k-nearest neighbor graphs
abstract
MOTIVATION: Hi-C technology provides insights into the 3D organization of the chromatin, and the single-cell Hi-C method enables researchers to gain knowledge about the chromatin state in individual cell levels. Single-cell Hi-C interaction matrices are high dimensional and very sparse. To cluster thousands of single-cell Hi-C interaction matrices, they are flattened and compiled into one matrix. Depending on the resolution, this matrix can have a few million or even billions of features; therefore, computations can be memory intensive. We present a single-cell Hi-C clustering approach using an approximate nearest neighbors method based on locality-sensitive hashing to reduce the dimensions and the computational resources. RESULTS: The presented method can process a 10 kb single-cell Hi-C dataset with 2600 cells and needs 40 GB of memory, while competitive approaches are not computable even with 1 TB of memory. It can be shown that the differentiation of the cells by their chromatin folding properties and, therefore, the quality of the clustering of single-cell Hi-C data is advantageous compared to competitive algorithms. AVAILABILITY AND IMPLEMENTATION: The presented clustering algorithm is part of the scHiCExplorer, is available on Github https://github.com/joachimwolff/scHiCExplorer, and as a conda package via the bioconda channel. The approximate nearest neighbors implementation is available via https://github.com/joachimwolff/sparse-neighbors-search and as a conda package via the bioconda channel. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Joachim Wolff, Rolf Backofen, Björn A. Grüning
Bioinform.1