Where and when
DSB 2026 will take place at Aula Magna Silvio Trentin, Ca’ Foscari University of Venice, Venice, Italy on February 18-19, 2026.
• Opening: February 18, 8:30–8:45
• Closing: February 19, 17:50–18:00
How to participate
Abstract submission deadline: January 2nd January 9th, 2026 AoE. Closed.
Registration deadline: January 31st, 2026 AoE. Click here to reach the registration form.
As in previous editions, there will be no formal review process. While we aim to provide everyone with an opportunity to present, the organizers reserve the right to select talks from the submissions to ensure a diverse and engaging program.
For this edition, there will be no registration fee.
Program
Wednesday, 18 February
| Registration | |
| Opening |
| Session 1: Data Structures and Indexing 1 ( Chair: Carlo Tosoni ) | |
| Limasset Antoine. Zor Filters: Fast and Smaller Than Binary Fuse Filters | |
| Ragnar Groot Koerkamp. QuadRank: Engineering a High Throughput Rank | |
| Nicola Rizzo, Nadia Pisanti, Veli Mäkinen. On the construction of Elastic Degenerate Strings |
| Break |
| Session 2: Comparative Genomics 1 ( Chair: Yoshihiro Shibuya ) | |
| Luca Renders, Lore Depuydt, Travis Gagie, Jan Fostier. Columba: Fast Approximate Pattern Matching with Optimized Search Schemes | |
| Leonard Bohnenkämper, Luca Parmigiani, Kamil Hepak, Cedric Chauve, Jens Stoye. MICE: Deriving Synteny Blocks by Compacting Elements | |
| Fawaz Dabbaghie, Martin Steinegger. gfaidx: sorting and indexing GFA graphs based on topology for node-based random access | |
| Tam Truong, Dominique Lavenier, Pierre Peterlongo, Karel Břinda. Phylogenetic ordering and batching of million-genome collections for reduced storage and faster retrieval |
| Lunch |
| Session 3: Compressed data structures ( Chair: Jarno Alanko ) | |
| Paola Bonizzoni, Davide Cozzi, Younan Gao. Optimal-Time Mapping in Run-Length Compressed PBWT | |
| Lorenzo Carfagna, Carlo Tosoni. New Entropy Measures for Tries with Applications to the XBWT | |
| Davide Tonetto, Alessio Campanelli, Ruben Becker, Nicola Prezza. A New Compression Technique for Repetitive Wheeler DFAs | |
| Davide Cologni, Sebastiano Vigna. Fast, Parallel, and Scalable Differential Graph Compression |
| Break |
| Session 4: Transcriptomics and Gene Expression ( Chair: Jasmijn Baaijens ) | |
| Inês Alves Ferreira, Jens Zentgraf, Johanna Elena Schmitz, Sven Rahmann. PanXpress: Gene expression estimation from a pan-transcriptomic reference using a gapped k-mer index | |
| Johanna Elena Schmitz, Jens Zentgraf, Sven Rahmann. Error Correction Algorithms for Efficient Gene Expression Quantification in Single Cell Transcriptomics | |
| Degardins Bastien, Marchet Camille, Paperman Charles. Optimizing de Bruijn Graph Parameters for Fusion and Splicing Event Detection in RNA Sequencing Data: First attempt at a comprehensive evaluation within the Vizitig Framework | |
| The Transipedia Consortium, Camille Marchet. The Transipedia project: index human transcriptomes for biomedical research |
Thursday, 19 February
| Session 5: Sampling and Sketching ( Chair: Florian Ingels ) | |
| Jarno N. Alanko, Elena Biagi, Simon J. Puglisi. Fast approximate pseudoalignment with finimizers | |
| Florian Ingels, Lucas Robidou, Igor Martayan, Camille Marchet, and Antoine Limasset. Minimizer Density revisited: Models and Multiminimizers | |
| Leonardo Gemin, Cinzia Pizzi, Matteo Comin. Fast hashing of spaced seeds with DuoHash |
| Break |
| Session 6: Comparative Genomics 2 ( Chair: Lore Depuydt ) | |
| Jorge Avila Cartes, Simone Ciccolella, Luca Denti, Raghuram Dandinasivara, Gianluca Della Vedova, Paola Bonizzoni, Alexander Schönhuth. PanSpace: Fast and Scalable Indexing for Massive Bacterial Databases | |
| Jasper van Bemmelen, Jasmijn Baaijens. Less is more: optimal reference set selection with ReSeT | |
| Daniel Puttini, Ruben Becker, Nicola Prezza, Sung-Hwan Kim, Davide Cenzato. A near-optimal algorithm for the Wheelerization problem with applications to computational pangenomics | |
| Alessio Campanelli, Giulio Ermanno Pibiri, Rob Patro. Fast pseudoalignment queries on compressed colored de Bruijn graphs |
| Lunch |
| Session 7: Data Structures and Indexing 2 ( Chair: Nicola Rizzo ) | |
| Tristan Dubos and Eric Rivals. Combinatorial questions and algorithms related to the enumeration of b-canonical words | |
| Victor Levallois, Yoshihiro Shibuya, Bertrand Le Gal, Rob Patro, Pierre Peterlongo, Giulio Ermanno Pibiri. Advancing Kaminari: Scaling up to real-world datasets with limited RAM | |
| Igor Martayan, Rob Patro, Camille Marchet. Scalable indexing and mapping of long sequences through locally consistent phrases | |
| Riccardo Maso, Nicola Prezza, Carlo Tosoni. An Efficient Approach to Wheeler Graph Indexing |
| Break |
| Session 8: k-mers and de Bruijn Graphs ( Chair: Alessio Campanelli ) | |
| Florian Ingels, Antoine Limasset. Improving minimizers-based k-mer partitioning | |
| Jarno Alanko. Constructing distinct color sets of k-mers | |
| Alix Regnier, Pierre Peterlongo. Compressing a petabyte of k-mer matrices | |
| Andrea Cracco, Sebastian Schmidt, Pierre Peterlongo, Alexandru I. Tomescu. Time-, Memory-, and Disk-Efficient Construction of Spectrum Preserving String Sets with GGCAT2 |
| Closing |
Organizers
DSB 2026 is organized by the RAVEN (Research on Algorithms VENice) research group at Ca' Foscari University of Venice.
- Nicola Prezza, Ca’ Foscari University of Venice
- Ruben Becker, Ca’ Foscari University of Venice
- Giulio Ermanno Pibiri, Ca’ Foscari University of Venice
- Alessio Campanelli, Ca’ Foscari University of Venice
- Carlo Tosoni, Ca’ Foscari University of Venice
- Daniel Puttini, Ca’ Foscari University of Venice
- Davide Cenzato, Ca’ Foscari University of Venice
- Davide Cologni, Ca’ Foscari University of Venice
- Davide Tonetto, Ca’ Foscari University of Venice
- Riccardo Maso, Ca’ Foscari University of Venice
- Sung-Hwan Kim, Sant’Anna School of Advanced Studies
For any questions about DSB 2026, please reach out to dsb26-organization-grpunive@unive.it.
Sponsors
Lots of thanks for the financial support of:
- Ca’ Foscari University of Venice
- REGINDEX: Compressed Indexes for Regular Languages with Applications to Computational Pan-genomics.
Funded by ERC StG “REGINDEX: Compressed indexes for regular languages with applications to computational pan-genomics” grant nr 101039208. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them.
Information about Venice
Travel. Venice is conveniently served by Venice Marco Polo Airport, located on the mainland approximately 13 kilometers (8 miles) north of Venice. For additional travel options, the nearest alternative airport is Treviso’s Antonio Canova Airport. From either airport, you can easily reach Venice by bus, water shuttle, or train; see the arriving-by-plane Venezia Unica webpage for detailed information. On top of that, the main train station, Venezia Santa Lucia, is well connected, with regular regional and high-speed trains from throughout Italy.
Getting Around in Venice. For getting around Venice, the public waterbus service (vaporetti) is the most convenient option. You can check real-time schedules, routes, and stop information using the website and app CheBateo. It’s a helpful tool to plan your trips across the old city and nearby islands efficiently.
Tourism. For information on attractions, historical sites, guided tours, and events, you can visit the official tourism website of Venice: Venezia Unica.
Accommodation
Venice and Mestre offer a wide range of accommodation options. You can stay in Mestre (for example, Hotel Alexander) and reach the city center easily by public transport, taking 10–15 minutes by train or bus. Alternatively, you can stay in Venice old town, within walking distance of the conference venue (for example, Albergo Marin, ~10 minutes; Hotel Sangallo, ~25 minutes).
The picture of Piazza San Marco was downloaded from Pexels.com.