Programme
Programme
Wednesday, 7 February, 2024
09.00 –17.00
Workshop Frontiers of String Algorithms and Bioinformatics at Birkbeck Central, BCB 311
Workshop Frontiers of String Algorithms and Bioinformatics at Birkbeck Central, BCB 311
18.00 Cocktail [The Marquis Cornwallis]
Thursday, 8 February, 2024
09.50 –10.00
Opening words/welcome to Sequences
Opening words/welcome to Sequences
10.00 –10.25
Sensitivity of string compressors and repetitiveness measures
Sensitivity of string compressors and repetitiveness measures
Shunsuke Inenaga
Shunsuke Inenaga
10.25 –10.50
Heuristics for the Run-Length Encoded Burrows-Wheeler Transform Alphabet Ordering Problem
Heuristics for the Run-Length Encoded Burrows-Wheeler Transform Alphabet Ordering Problem
Lily Major
Lily Major
10.50 –11.20
Coffee Break
Coffee Break
11.20 –11.45
Computing the optimal BWT of very large string collections
Computing the optimal BWT of very large string collections
Veronica Guerrini
Veronica Guerrini
11.45 –12.10
r-indexing without backward searching
r-indexing without backward searching
Lore Depuydt
Lore Depuydt
12.10 –14.30
Lunch break
Lunch break
14.30 –14.55
Utility-Oriented String Mining
Utility-Oriented String Mining
Giulia Bernardini
Giulia Bernardini
14.55 –15.20
Counting K2,t subgraphs
Counting K2,t subgraphs
Angelina McDonald
Angelina McDonald
15.20 –15.50
Coffee Break
Coffee Break
15.50 –16.15
Maximal CIH Seeding: A Novel Strategy for Enhanced Genomic Sequence Similarity
Maximal CIH Seeding: A Novel Strategy for Enhanced Genomic Sequence Similarity
Sasha Darmon
Sasha Darmon
16.15 –16.40
Masked superstrings as a unified framework for textual k-mer set representations
Masked superstrings as a unified framework for textual k-mer set representations
Ondřej Sladký
Ondřej Sladký
18.30 Drinks at Coin Laundry
19.30 Dinner at Dame Alice Owen pub
Friday, 9 February, 2024
10.00 –10.25
Linear Time Construction of Cover Suffix Tree and Applications
Linear Time Construction of Cover Suffix Tree and Applications
Jakub Radoszewski
Jakub Radoszewski
10.25 –10.50
Longest Common Substring and Longest Palindromic Substring in O(√n) Time
Longest Common Substring and Longest Palindromic Substring in O(√n) Time
Arianna Pavone
Arianna Pavone
10.50 –11.20
Coffee Break
Coffee Break
11.20 –11.45
A quantum circuit for the cyclic rotation operator and its applications to string matching problems
A quantum circuit for the cyclic rotation operator and its applications to string matching problems
Caterina Viola
Caterina Viola
11.45 –12.10
Space-Efficient Indexes for Uncertain Strings
Space-Efficient Indexes for Uncertain Strings
Estéban Gabory
Estéban Gabory
12.10 –14.30
Lunch break
Lunch break
14.30 –17.00
Free discussion
Free discussion
18.00 Closing Party at [ Coin Laundry]