Click here for the current academic year.
The Monday meetings of the Algorithms Group of the University of Verona take place every Monday at 6 p.m. (Italian time), and have been taking place online (zoom) since March 2020. Working language is English (optionally: Italian). If you are interested in participating, send me an email.
Click here for last year's Monday meetings (2019/2020).
| date | speaker | title | literature |
|---|---|---|---|
| Tue, Feb 23, 2021 | everyone | just chatting; planning of talks | -- |
| Mon, March 1, 2021 | Zsuzsanna Lipták & Luca Parmigiani |
News on de Bruijn sequences | ongoing work |
| Mon, March 8, 2021 | Andrea Caucchiolo | On the leaves that make arborescences hard to color | -- |
| Mon, March 15, 2021 |
Margherita de Riu Anna Toffanello |
A GPCR database driven 3D-modeling pipeline for GOMoDo Experiments on the runs-ratio of the Burrows-Wheeler-Transform |
master theses (Mock laurea presentations) |
| Mon, March 22, 2021 | Giuseppe Romana | A combinatorial view on string attractors | Sabrina Mantaci, Antonio Restivo, Giuseppe Romana, Giovanna Rosone, Marinella Sciortino: A combinatorial view on string attractors, Theoret. Comp. Sc. 850: 236-248 (2021) |
| Mon, March 29, 2021 | Sonia Morasso | From multisets to phylogenetic trees | master thesis topic |
| Mon, April 5, 2021 | --- | (Easter) | -- |
| Mon, April 12, 2021 | Matteo Zeggiotti | On the complexity of the RDIN-Problem | master thesis topic |
| Mon, April 19, 2021 | -- | (no meeting) | -- |
| Mon, April 26, 2021 | Margherita De Riu | On power BWTs | project work |
| Mon, May 3, 2021 | Francesco Masillo | Advances on the DollarBWT topic: pseudo-cycles finder | master thesis work |
| Mon, May 10, 2021 | Ferdinando Cicalese | Some Basics of Complexity Theory | -- |
| Mon, May 17, 2021 | Nicolò Pilati | On the tandem duplication problem | Ferdinando Cicalese and Nicolò Pilati: The Tandem Duplication Distance Problem is hard over bounded alphabets, to be presented at: 32nd Int. Workshop on Combinatorial Algorithms (IWOCA 2021), 5-7 July, 2021, Ottawa, Canada. |
| Mon, May 24, 2021 | -- | (no meeting) | -- |
| Mon, May 31, 2021 | Massimiliano Rossi | A small introduction to FFT | -- |
| Mon, June 7, 2021 | -- | (no meeting) | -- |
| Mon, June 14, 2021 | -- | (no meeting) | -- |
| Mon, June 21, 2021 | Davide Cenzato | On variants of the BWT for string collections | -- |
| Mon, June 28, 2021 | -- | (no meeting) | -- |
| Mon, July 5, 2021 | -- | (no meeting: CPM and IWOCA) | -- |
| Mon, July 12, 2021 | Francesco Masillo Matteo Zeggiotti |
On data structures and algorithms for permutations and the Burrows-Wheeler-Transform Sulla complessità del problema RDIN |
master thesis presentations (mock laurea talks) |
| date | speaker | title | literature |
|---|---|---|---|
| Fri, Oct. 2, 2020 | Eros Rossi | Symbolwise MAP decoding for Multiple Deletion Channel: heuristics and experiments (mock laurea talk) |
master thesis |
| Fri, Oct. 9, 2020 | Andrea Caucchiolo | Complexity and Algorithmic Questions on the Directed Intersection Representation of DAGs (mock laurea talk) |
master thesis and
partially overlapping with: Andrea Caucchiolo and Ferdinando Cicalese: On the complexity of directed intersection representation of DAGs The 26th International Computing and Combinatorics Conference (COCOON 2020), LNCS 12273: 554-565. |
| Mon, Oct. 12, 2020 | Sara Giuliani | Novel Results on the Number of Runs of the BWT (Abstract to be presented at the 15th Workshop on Compression, Text and Algorithms (WCTA 2020)) |
S. Giuliani, S. Inenaga, Zs. Lipták, N. Prezza, M. Sciortino, A. Toffanello: Novel Results on the Number of Runs of the Burrows-Wheeler-Transform, to appear in: Proc. of the 47th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2021), Bolzano-Bozen, Italy, Jan. 25-28, 2021. See here for Arxiv version. |
| --- | --- | interruption | --- |
| Tue, Nov. 17, 2020 | Davide Cenzato & Sara Giuliani |
How to give a good talk / When a Dollar Makes a BWT (short version) |
Davide will tell us what they learned in Prof. Giacobazzi's PhD course on "How to give a good talk", and Sara will give us a practical demonstration. |
| Tue, Nov. 24, 2020 | --- | ||
| Tue, Dec. 1, 2020 | Francesco Masillo | On implementing the DollarBWT algorithm | project work |
| Tue, Dec. 8, 2020 | --- | (public holiday) | |
| Tue, Dec. 15, 2020 | Davide Cenzato | Multiple Sequence Alignment is NP-hard | Lusheng Wang, Tao Jiang: On the Complexity of Multiple Sequence Alignment. J. Comput. Biol. 1(4): 337-348 (1994), Martin Middendorf: More on the Complexity of Common Superstring and Supersequence Problems. Theor. Comput. Sci. 125(2): 205- 228 (1994) |
| Tue, Dec. 22, 2020 | Sara Giuliani | On the complexity of BWT runs minimization | J. Bentley, D. Gibney, S. Thankachan: "On the complexity of BWT runs minimization via alphabet reordering" 28th Annual European Symposium on Algorithms (ESA 2020) full version, see on Arxiv |
| Tue, Jan 5, 2021 | Massimiliano Rossi | PFP Compressed Suffix Trees | C. Boucher, O. Cvacho, T. Gagie, J. Holub, G. Manzini, G. Navarro, M. Rossi: "PFP Compressed Suffix Trees", to be presented at: SIAM Symposium on Algorithm Engineering and Experiments (ALENEX 2021), see here |
| Tue, Jan. 12, 2021 | --- | (SODA/SOSA/ALENEX) | |
| Tue, Jan. 19, 2021 | Davide Cenzato | Constructing the Bijective BWT | Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski: Constructing the Bijective BWT. CoRR abs/1911.06985 |
| Tue, Jan. 26, 2021 | Massimiliano Rossi | On the Redundancy of D-ary Fano Codes | Ferdinando Cicalese and Massimiliano Rossi: On the Redundancy of D-ary Fano Codes, to be presented at: SOFSEM 2021 |
| Tue, Feb. 2, 2021 | Sara Giuliani | On the complexity of BWT runs minimization, part 2 | J. Bentley, D. Gibney, S. Thankachan: "On the complexity of BWT runs minimization via alphabet reordering" 28th Annual European Symposium on Algorithms (ESA 2020) full version, see on Arxiv |
Click here for last year's Monday meetings (2019/2020).