VLDB 2026 Research / reviewers in the wild / expert
Saska Dönges
dblp:309/3917
· DBLP profile ↗
4ranked-venue papers
2as first author
4since 2021 · last 2025
0009-0004-2133-3661ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Theory of computation · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 1 · 1 since 2021
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Succinct Rank Dictionaries Revisited
Saska Dönges, Simon J. Puglisi |
SEA | 1 |
| 2023 | Simple Runs-Bounded FM-Index Designs Are Fast
Diego Díaz-Domínguez, Saska Dönges, Simon J. Puglisi, Leena Salmela |
SEA | 2 |
| 2022 | On Dynamic Bitvector ImplementationsabstractBitvectors that support rank and select queries are the workhorses of succinct data structures, implementations of which are now widespread, for example, in bioinformatics software. To date, however, most bitvector implementations are static, thus forcing more complex data structures built from them to be static too. In this paper we explore dynamic bitvectors, which, in addition to rank and select queries, also support update operations, specifically: insert, remove, and modify. We first provide several practical optimizations to the recent B-tree based bitvectors of Prezza (Proc. SEA 2017), including the use of buffers at leaves to speed update operations at the cost of a small overhead to query times. We then consider a common use case of succinct data structures, where queries and updates come in separate batches, and examine the efficacy of query support data structures that are fast to construct and speed rank and select queries, but become out of date when update operations are made. Finally, we explore several methods for leaf compression. Saska Dönges, Simon J. Puglisi, Rajeev Raman |
DCC | 1 |
| 2021 | Founder reconstruction enables scalable and seamless pangenomic analysisabstractMOTIVATION: Variant calling workflows that utilize a single reference sequence are the de facto standard elementary genomic analysis routine for resequencing projects. Various ways to enhance the reference with pangenomic information have been proposed, but scalability combined with seamless integration to existing workflows remains a challenge. RESULTS: We present PanVC with founder sequences, a scalable and accurate variant calling workflow based on a multiple alignment of reference sequences. Scalability is achieved by removing duplicate parts up to a limit into a founder multiple alignment, that is then indexed using a hybrid scheme that exploits general purpose read aligners. Our implemented workflow uses GATK or BCFtools for variant calling, but the various steps of our workflow (e.g. vcf2multialign tool, founder reconstruction) can be of independent interest as a basis for creating novel pangenome analysis workflows beyond variant calling. AVAILABILITY AND IMPLEMENTATION: Our open access tools and instructions how to reproduce our experiments are available at the following address: https://github.com/algbio/panvc-founders. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online. Tuukka Norri, Bastien Cazaux, Saska Dönges, Daniel Valenzuela 0001, Veli Mäkinen |
Bioinform. | 3 |