| Time | Speaker | Title |
|---|
| 9h00-9h45 | | Welcoming coffee |
| 9h45-10h00 | | Introduction |
| 10h00-11h00 | Louis Jachiet | Measuring the algorithmic complexity of algorithms : RAM model, lower bounds, upper bounds |
| 11h00-11h30 | Thierry Lecroq | FM-index of Alignment with Gaps |
| 11h30-12h00 | Sangsoo Park, Sung Gwan Park, Bastien Cazaux, Kunsoo Park and Eric Rivals | A Linear Time Algorithm for Constructing Hierarchical Overlap Graphs |
| 12h00-13h30 | | Lunch |
| 13h30-14h30 | Everyone | Open discussions |
| 14h30-15h00 | Charles Paperman | Efficient evaluation on data parallelism |
| 15h00-15h30 | | Coffee break |
| 15h30-16h00 | Antoine Amarilli | Data structures for incremental maintenance of string properties under updates |
| 16h00-16h30 | Rayan Chikhi | A perspective on current big biological sequence datasets and their search capabilities |