Program

The schedule of talks, posters, and events for the main WABI meeting from August 20-22, 2025.

#I0

:45		Opening Remarks
9:00		We are what we index; a primer for the Wheeler Graph era Ben Langmead Talk
:15
:30
:45
10:00		An Efficient Data Structure and Algorithm for Long-Match Query in Run-Length Compressed BWT Ahsan Sanaullah, Degui Zhi, Shaojie Zhang Talk
:15
:30		Partitioned Multi-MUM finding for scalable pangenomics Vikram Shivakumar, Ben Langmead Talk
:45
11:00
:15
:30		DiVerG: Scalable Distance Index for Validation of Paired-End Alignments in Sequence Graphs Ali Ghaffaari, Alexander Schönhuth, Tobias Marschall Talk
:45
12:00		Haplotype-aware long-read error correction Parvesh Barak, Daniel Gibney, Chirag Jain Talk
:15
:30
:45
13:00
:15
:30		Human readable compression of GFA paths using grammar-based code Peter Heringer, Daniel Doerr Talk
:45
14:00		Estimation of substitution and indel rates via k-mer statistics Mahmudur Rahman Hera, Paul Medvedev, David Koslicki, Antonio Blanca Talk
:15
:30		K-mer-based estimators of the substitution rate of repetitive sequences Haonan Wu, Antonio Blanca, Paul Medvedev Talk
:45
15:00
:15
:30		Fast pseudoalignment queries on compressed colored de Bruijn graphs Alessio Campanelli, Giulio Ermanno Pibiri, Rob Patro Talk
:45
16:00		Lossless Pangenome Indexing Using Tag Arrays Parsa Eskandar, Benedict Paten, Jouni Sirén Talk
:15
:30		Poster session + reception
:45
17:00
:15
:30
:45

#I0

9:00		Recursive Parsing and Grammar Compression in the Era of Pangenomics Christina Boucher Talk
:15
:30
:45
10:00		Design of Worst-Case-Optimal Spaced Seeds Jens Zentgraf, Sven Rahmann Talk
:15
:30		Sequence similarity estimation by random subsequence sketching Ke Chen, Vinamratha Pattar, Mingfu Shao Talk
:45
11:00
:15
:30		Approximability of Longest Run Subsequence and Complementary Minimization Problems Yuichi Asahiro, Mingyang Gong, Jesper Jansson, Guohui Lin, Sichen Lu, Eiji Miyano, Hirotaka Ono, Toshiki Saitoh, Shunichi Tanaka Talk
:45
12:00		Linear-space Subquadratic-time String Alignment Algorithm for Arbitrary Scoring Matrices Ryosuke Yamano, Tetsuo Shibuya Talk
:15
:30
:45
13:00
:15
:30		Mutational signature refitting on sparse pan-cancer data Gal Gilad, Teresa Przytycka, Roded Sharan Talk
:45
14:00		Dolphyin: A Combinatorial Algorithm for Identifying 1-Dollo Phylogenies in Cancer Daniel Feng, Mohammed El-Kebir Talk
:15
:30		Improved Algorithms for Bi-partition Function Computation John Bridgers, Jan Hoinka, S. Cenk Sahinalp, Salem Malikic, Teresa Przytycka, A. Funda Ergun Talk
:45
15:00		Graph-Based Extension of Partial Atom Maps: Theoretical Uniqueness and Practical Algorithms Marcos E. González Laffitte, Tieu-Long Phan, Talk
:15
:30
:45
16:00		Business meeting (& posters redux)
:15
:30
:45
17:00
:15

#I0

9:00		Identifying Breakpoint Median Genomes: A Branching Algorithm Approach Poly H. da Silva, Arash Jamshidpey, David Sankoff Talk
:15
:30		Spark: sparsified hierarchical energy minimization of RNA pseudoknots Mateo Gray, Sebastian Will, Hosna Jabbari Talk
:45
10:00
:15
:30		Which Phylogenetic Networks are Level-k Networks with Additional Arcs? Structure and Algorithms Takatora Suzuki, Momoko Hayamizu Talk
:45
11:00		Average-Tree Phylogenetic Diversity of Networks Leo van Iersel, Mark Jones, Jannik Schestag, , Mathias Weller Talk
:15
:30		Closing Remarks
:45		Closing Remarks

Keynote

Proceedings

Other