List of talks of previous years:
| date | speaker | title | literature |
|---|---|---|---|
| Mon, Mar. 11, 2024 | Luca Parmigiani | A BWT-based algorithm for random de Bruijn sequence construction | Zsuzsanna Lipták and Luca Parmigiani: A BWT-based algorithm for random de Bruijn sequence construction. Accepted at LATIN 2024. Paper here: link. Code is available (in C++ and python) at Luca's github. |
| Mon, Mar. 18, 2024 | Davide Cenzato | Sketching and Streaming for Dictionary Compression | Ruben Becker, Matteo Canton, Davide Cenzato, Sung-Hwan Kim, Bojana Kodric, Nicola Prezza: Sketching and Streaming for Dictionary Compression, accepted at DCC 2024. |
| Mon, Mar. 25, 2024 | -- | -- | -- |
| Mon, April 1, 2024 | -- | (Easter Monday) | -- |
| Mon, April 8, 2024 | Elena Biagi | Finimizers: Variable-length bounded-frequency minimizers for k-mer sets | Jarno N. Alanko, Elena Biagi, Simon J. Puglisi: Finimizers: Variable-length bounded-frequency minimizers for k-mer sets. Paper on bioarxiv, code: Elena's github. |
| Mon, Apr. 15, 2024 | Giuseppe Romana | Repetitiveness Measures for 2D strings | Giuseppe Romana, Marinella Sciortino, Cristian Urbina: Repetitiveness Measures for 2D strings, see here for arxiv version. |
| Mon, April 22, 2024 | Ferdinando Cicalese | On the complexity and approximability of Bounded access Lempel Ziv coding | Ferdinando Cicalese and Francesca Ugazio: On the complexity and approximability of Bounded access Lempel Ziv coding. Paper on arxiv: here. |
| Mon, April 29, 2023 | -- | (cancelled due to illness) | |
| Mon, May 6, 2024 | Luca Parmigiani | Interpolating node counts in colored compacted de Bruijn graphs for pangenome graph diversity | ongoing work |
| Mon, May 13, 2024 | Francesco Masillo | BAT-LZ Out of Hell | Zsuzsanna Lipták, Gonzalo Navarro, Francesco Masillo, BAT-LZ Out of Hell, to appear in CPM 2024; see Arxiv version |
| Mon, May 20, 2024 | -- | (no meeting due to San Zeno on 21 May) | -- |
| Mon, May 27, 2024 | Ferdinando Cicalese | On the complexity and approximability of Bounded access Lempel Ziv coding (part 2) | Ferdinando Cicalese and Francesca Ugazio: On the complexity and approximability of Bounded access Lempel Ziv coding. To appear in DLT 2024. Paper on arxiv: here. |
| Mon, June 3, 2024 | Zsuzsanna Lipták | BWT everywhere | |
| Mon, June 10, 2024 | Ruben Becker | tba | |
| Mon, June 17, 2024 | tbd |
| date | speaker | title | literature |
|---|---|---|---|
| Mon, Oct. 9, 2023 | all | Introduction and distribution of dates | |
| Mon, Oct. 16, 2023 | Giuseppe Romana | Circular String Attractors: an algorithmic overview | Giuseppe Romana: Algorithmic View on Circular String Attractors, ICTCS 2023, Palermo, 13-15 Sept. 2023 (paper) |
| Mon, Oct. 23, 2023 | Francesco Masillo | Matching Statistics speed up BWT construction | Francesco Masillo: Matching Statistics speed up BWT construction, ESA 2023, Amsterdam, 4-6 Sept. 2023 (paper) |
| Mon, Oct. 30, 2023 | Andrea Cracco | Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT | Andrea Cracco, Alexandru I. Tomescu: Extremely fast construction and querying of compacted and colored de Bruijn graphs with GGCAT. Genome Research 2023 (paper) |
| Mon, Nov. 6, 2023 | Elena Biagi | On the number of equal-letter runs of the Bijective Burrows-Wheeler Transform | Elena Biagi, Davide Cenzato, Zsuzsanna Lipták and Giuseppe Romana: On the number of equal-letter runs of the Bijective Burrows-Wheeler Transform, ICTCS 2023, Palermo, 13-15 Sept. 2023 (paper). |
| Mon, Nov. 13, 2023 | Davide Cenzato | On indexing string collections using the extended BWT | Christina Boucher, Davide Cenzato, Zsuzsanna Lipták, Massimiliano Rossi, Marinella Sciortino: r-indexing the eBWT SPIRE 2021: 3-12. |
| Mon, Nov. 20, 2023 | Cristian Urbina | Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data, by De and Kempa | Rajat De and Dominik Kempa (Stony Brook University): Grammar Boosting: A New Technique for Proving Lower Bounds for Computation over Compressed Data, accepted at SODA24, arXiv version: |
| Mon, Nov. 27, 2023 | Zsuzsanna Lipták | A shorthand universal cycle for fixed-weight binary strings by Ruskey, Sawada, and Williams (part 1) | Frank Ruskey, Joe Sawada, Aaron Williams: De Bruijn sequences for fixed-weight binary strings, SIAM J Discrete Math. Vol. 26, No. 2, pp. 605-617 (2012) |
| Mon, Dec. 4, 2023 | Martina Lucà | Efficient matching statistics calculation in large text collections | Project work with Francesco Masillo |
| Mon, Dec. 11, 2023 | Zsuzsanna Lipták | A shorthand universal cycle for fixed-weight binary strings by Ruskey, Sawada, and Williams (part 2) | Frank Ruskey, Joe Sawada, Aaron Williams: De Bruijn sequences for fixed-weight binary strings, SIAM J Discrete Math. Vol. 26, No. 2, pp. 605-617 (2012) |
| Mon, Dec. 18, 2023 | -- | -- | -- |
| Mon, Jan. 8, 2024 | Zsuzsanna Lipták | On the Burrows-Wheeler Transform of string collections | Practice for my online talk in the series 'Primavera dell'Informatica Teorica', given on 11 Jan. 2024, see here: talk abstract and video |
List of talks of previous years: