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

Daniel Doerr

dblp:22/10085 · also Daniel Dörr · DBLP profile ↗
← Back
9ranked-venue papers
3as first author
4since 2021 · last 2025
0000-0002-3720-6227ORCID · verified

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

Applied, interdisciplinary, general and emerging computing · 9 · 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 · 100%
Theoretical computer science
1 paper
Algorithms and data structures · 100%

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

TopicWeightPapersLastEvidence papers
Bioinformatics and computational biology › comparative genomics
pangenomics
0.812024
Panacus: fast and exact pangenome growth and core size estimation · Bioinform. 2024
Bioinformatics and computational biology
comparative genomics
0.722020
Computing the Rearrangement Distance of Natural Genomes · RECOMB 2020
New Genome Similarity Measures Based on Conserved Gene Adjacencies · RECOMB 2016
Bioinformatics and computational biology › comparative genomics
genome rearrangement
0.722020
Computing the Rearrangement Distance of Natural Genomes · RECOMB 2020
New Genome Similarity Measures Based on Conserved Gene Adjacencies · RECOMB 2016
Algorithms and data structures › sequence algorithms
string algorithms
0.112016
New Genome Similarity Measures Based on Conserved Gene Adjacencies · RECOMB 2016

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

interactive visualization · 0.8graph traversal · 0.8adjacency-based similarity · 0.5
YearPublicationVenuePosition
2025 Human Readable Compression of GFA Paths Using Grammar-Based Code
abstract
International audience
Peter Heringer, Daniel Doerr
WABI2
2024 Reconstructing Rearrangement Phylogenies of Natural Genomes
Leonard Bohnenkämper, Jens Stoye, Daniel Doerr
WABI3
2024 Panacus: fast and exact pangenome growth and core size estimation
abstract
MOTIVATION: Using a single linear reference genome poses a limitation to exploring the full genomic diversity of a species. The release of a draft human pangenome underscores the increasing relevance of pangenomics to overcome these limitations. Pangenomes are commonly represented as graphs, which can represent billions of base pairs of sequence. Presently, there is a lack of scalable software able to perform key tasks on pangenomes, such as quantifying universally shared sequence across genomes (the core genome) and measuring the extent of genomic variability as a function of sample size (pangenome growth). RESULTS: We introduce Panacus (pangenome-abacus), a tool designed to rapidly perform these tasks and visualize the results in interactive plots. Panacus can process GFA files, the accepted standard for pangenome graphs, and is able to analyze a human pangenome graph with 110 million nodes in <1 h. AVAILABILITY AND IMPLEMENTATION: Panacus is implemented in Rust and is published as Open Source software under the MIT license. The source code and documentation are available at https://github.com/marschall-lab/panacus. Panacus can be installed via Bioconda at https://bioconda.github.io/recipes/panacus/README.html.
Luca Parmigiani, Erik Garrison, Jens Stoye, Tobias Marschall, Daniel Doerr
Bioinform.5
2022 Constructing Founder Sets Under Allelic and Non-Allelic Homologous Recombination
Konstantinn Bonnet, Tobias Marschall, Daniel Doerr
WABI3
2020 Computing the Rearrangement Distance of Natural Genomes
Leonard Bohnenkämper, Marília D. V. Braga, Daniel Doerr, Jens Stoye
RECOMB3
2016 New Genome Similarity Measures Based on Conserved Gene Adjacencies
Luis A. B. Kowada, Daniel Doerr, Simone Dantas, Jens Stoye
RECOMB2
2016 The Gene Family-Free Median of Three
abstract
The gene family-free framework for comparative genomics aims at providing methods for gene order analysis that do not require prior gene family assignment, but work directly on a sequence similarity graph. We study two problems related to the breakpoint median of three genomes, which asks for the construction of a fourth genome that minimizes the sum of breakpoint distances to the input genomes. We present a model for constructing a median of three genomes in this family-free setting, based on maximizing an objective function that generalizes the classical breakpoint distance by integrating sequence similarity in the score of a gene adjacency. We study its computational complexity and we describe an integer linear program (ILP) for its exact solution. We further discuss a related problem called family-free adjacencies for k genomes for the special case of $$k \le 3$$ and present an ILP for its solution. However, for this problem, the computation of exact solutions remains intractable for sufficiently large instances. We then proceed to describe a heuristic method, FFAdj-AM, which performs well in practice. The developed methods compute accurate positional orthologs for genomes comparable in size of bacterial genomes on simulated data and genomic data acquired from the OMA orthology database. In particular, FFAdj-AM performs equally or better when compared to the well-established gene family prediction tool MultiMSOAR. We study the computational complexity of a new family-free model and present algorithms for its solution. With FFAdj-AM, we propose an appealing alternative to established tools for identifying higher confidence positional orthologs.
Daniel Doerr, Pedro Feijão, Metin Balaban, Cédric Chauve
WABI1
2012 Gene family assignment-free comparative genomics
abstract
BACKGROUND: The comparison of relative gene orders between two genomes offers deep insights into functional correlations of genes and the evolutionary relationships between the corresponding organisms. Methods for gene order analyses often require prior knowledge of homologies between all genes of the genomic dataset. Since such information is hard to obtain, it is common to predict homologous groups based on sequence similarity. These hypothetical groups of homologous genes are called gene families. RESULTS: This manuscript promotes a new branch of gene order studies in which prior assignment of gene families is not required. As a case study, we present a new similarity measure between pairs of genomes that is related to the breakpoint distance. We propose an exact and a heuristic algorithm for its computation. We evaluate our methods on a dataset comprising 12 γ-proteobacteria from the literature. CONCLUSIONS: In evaluating our algorithms, we show that the exact algorithm is suitable for computations on small genomes. Moreover, the results of our heuristic are close to those of the exact algorithm. In general, we demonstrate that gene order studies can be improved by direct, gene family assignment-free comparisons.
Daniel Doerr, Annelyse Thévenin, Jens Stoye
BMC Bioinform.1
2011 Stochastic Errors vs. Modeling Errors in Distance Based Phylogenetic Reconstructions - (Extended Abstract)
Daniel Doerr, Ilan Gronau, Shlomo Moran, Irad Yavneh
WABI1