Click here for the current academic year.
The Monday meetings of the Algorithms Group of the University of Verona take place every Monday at 5 p.m. (Italian time), and have been taking place online (zoom) since March 2020. We have decided to stick to the online mode (zoom), since several of our regular members are physically in other places (in other cities, in other countries, or even on other continents!)
Working language is English. If you are interested in participating, send me an email.
The person in charge of coordinating the meetings is Francesco Masillo (francesco dot masillo at univr dot it).
List of talks of previous years:
| date | speaker | title | literature |
|---|---|---|---|
| Mon, Feb. 27, 2023 | Davide Cenzato | Computing the optimal BWT of very large string collections | Davide Cenzato, Veronica Guerrini, Zsuzsanna Lipták, Giovanna Rosone: Computing the optimal BWT of very large string collections, DCC 2023, published paper; Arxiv version see here: Arxiv. |
| Mon, Mar. 6, 2023 | Simona Busiol | On Powers of BWT Images | practice laurea talk |
| Mon, Mar. 13, 2023 | Elena Biagi | Subset Wavelet Trees | Jarno N. Alanko, Elena Biagi, Simon J. Puglisi, Jaakko Vuohtoniemi: Subset Wavelet Trees, SEA 2023, see here for paper |
| Mon, Mar. 20, 2023 | Simona Busiol | On Powers of BWT Images (extended talk) | presentation of thesis work |
| Mon, Mar. 27, 2023 | -- | -- | |
| Mon, April 3, 2023 | -- | -- | |
| Mon, April 10, 2023 | -- | (Easter Monday) | |
| Mon, April 17, 2023 | -- | -- | |
| Mon, April 24, 2023 | Marinella Sciortino | On the impact of morphisms on BWT-runs | Gabriele Fici, Giuseppe Romana, Marinella Sciortino and Cristian Urbina: On the impact of morphisms on BWT-runs, CPM 2023, see here for paper. |
| Mon, May 1, 2023 | -- | (Labour Day) | |
| Mon, May 8, 2023 | Giuseppe Romana | Impressions from Mexico | |
| Mon, May 15, 2023 | Davide Cenzato | Using relational partition refinement to sort Wheeler NFAs | joint work with Ruben Becker, Manuel Caceres Reyes, Sung-Hwan Kim, Bojana Kodric, Francisco Olivares, and Nicola Prezza |
| Mon, May 22, 2023 | Sara Giuliani | BWT of some words with arithmetically progressed SA | Dominik Köppl and Tomohiro I: Arithmetics on Suffix Arrays of Fibonacci Words, WORDS 2015, see here for paper. |
| Mon, May 29, 2023 | Luca Parmigiani | A BWT-based algorithm for random de Bruijn sequence construction | joint work with Zsuzsanna Lipták, submitted. |
| Mon, June 5, 2023 | -- | -- | |
| Mon, June 12, 2023 | -- | -- | |
| Mon, June 19, 2023 | Giuseppe Romana | Worst-case sensitivity on the number of BWT-runs | Sara Giuliani, Shunsuke Inenaga, Zsuzsanna Lipták, Giuseppe Romana, Marinella Sciortino and Cristian Urbina: Bit Catastrophes for the Burrows-Wheeler Transform, DLT 2023, see here for paper. |
| Mon, June 26, 2023 | -- | (CPM in Paris) |
| date | speaker | title | literature |
|---|---|---|---|
| Mon, Oct. 10, 2022 | Francesco Masillo | An overview of a simple linear-time Lyndon array construction algorithm | Jonas Ellert: Lyndon Arrays Simplified, ESA 2022. See here for paper. |
| Mon, Oct. 17, 2022 | Davide Cenzato | Computing the optimal BWT using SAIS | Accepted for presentation at WCTA 2022 (Concepción, Chile), see here for abstract. |
| Mon, Oct. 24, 2022 | Giuseppe Romana | String Attractors and Infinite Words | Antonio Restivo, Giuseppe Romana, Marinella Sciortino: String Attractors and Infinite Words. Accepted for presentation at LATIN 2022. See here for arxiv version. |
| Mon, Oct. 31, 2022 | -- | (Halloween) | |
| Mon, Nov. 7, 2022 | Francesco Masillo | Maintaining the cycle structure of permutations efficiently | Accepted for presentation at WCTA 2022 (Concepción, Chile), see here for abstract. |
| Mon, Nov. 14, 2022 | Ferdinando Cicalese | Decision Trees with Short Explainable Rules | Victor Feitosa Souza, Ferdinando Cicalese, Eduardo Sany Laber, Marco Molinaro: Decision Trees with Short Explainable Rules. Accepted for presentation at NeurIPS 2022, see here for paper (and reviews): link to paper |
| Mon, Nov. 21, 2022 | -- | -- | |
| Mon, Nov. 28, 2022 | Luca Parmigiani | Revisiting pangenome openness with k-mers | Luca Parmigiani, Roland Wittler, Jens Stoye: Revisiting pangenome openness with k-mers. Paper available at: bioarxiv. |
| Mon, Dec. 5, 2022 | Sara Giuliani | Properties of SA of Fibonacci Words | Dominik Köppl and Tomohiro I: Arithmetics on Suffix Arrays of Fibonacci Words, WORDS 2015, see here for paper. |
| Mon, Dec. 12, 2022 | Simon Puglisi | Document Listing Through the Ages: Sins and Salvation | Simon Puglisi and Bella Zhukova: Document Retrieval Hacks, SEA 2021. See here for paper. |
| Mon, Dec. 19, 2022 | Zsuzsanna Lipták | Efficiently ranking and unranking permutations. | Wendy J. Myrvold, Frank Ruskey: Ranking and unranking permutations in linear time. Inf. Process. Lett. 79(6): 281-284 (2001). |
| Mon, Jan. 9, 2023 | Francesco Masillo | Entropy bounds on the BWT (part 1) | Giovanni Manzini, An analysis of the Burrows-Wheeler transform, J. ACM, volume 48 number 3, pp. 407-430, 2001 |
| Mon, Jan. 16, 2023 | Francesco Masillo | Entropy bounds on the BWT (part 2) | (same as last week) |
List of talks of previous years: