Compressed data structures lie at the intersection of data structures and data compression. Often, if a particular data set is compressible, a data structure built from it is compressible too. The aim of compressed data structuring is to reduce the space consumed by a data structure using techniques from data compression, but to simultaneously support fast operations on the data structure too. Compressed data structures (and their cousins, succinct data structures) are a relatively young branch of computer science, but have already found heavy use in bioinformatics, database systems, and search engines.
December 2023
Simon visiting Hideo Bannai in Tokyo.
Touko Puro receives his MSc degree.
November 2023
Simon is an opponent at Garance Gourdel's PhD defence at Ecole Normale Superieur in Paris.
October 2023
Simon is an opponent at Max Pedersen's PhD defence at TU Denmark.
Elena, Jarno, and Simon attend the Symposium on String Processing and Information Retrieval (SPIRE) in Pisa. Elena presenting work on Longest-common-suffix array construction.
July 2022
Simon attends the Annual Symposium on Combinatorial Pattern Matching in Paris.
June 2022
Elena, Saska, and Simon attend the Symposium on Experimental Algorithms (SEA) in Barcelona.
Elena, Jarno, and Simon visit Zamin Iqbal's lab at the European Bioinformatics Institute.
May 2023
"Small Searchable k-Spectra via Subset Rank Queries on the Spectral Burrows-Wheeler Transform" wins the Best Paper Award at the SIAM Conference on Applied and Computational Discrete Algorithms in Seattle, USA.
October 2022
Elena Biagi (late of U. Verona) is starting a PhD in our group!
April 2022
Saska presents at the Data Compression Conference in Snowbird, Utah.
June 2021
Weighted-level ancestor queries revisited wins the Alberto Apostolico Best Paper Award at the Annual Symposium on Combinatorial Pattern Matching.
March 2021
Papers accepted to CPM and SEA:
D. Belazzogui, D. Kosolobov, S. J. Puglisi, & R. Raman, "Weighted-level ancestor queries revisited", to appear at CPM
S. J. Puglisi & B. Zhukova, "Document Listing Hacks", to appeat at SEA
January 2021
Papers appear in print at JCSS (on block trees) and TCS (on suffix tree breadth)
Saska Dönges starts as a PhD student
December 2020
Three journal papers appear this month at Bioinformatics, Algorithmica, and Algorithms + two papers accepted to the 2021 Data Compression Conference:
Simon J. Puglisi & Bella Zhokova, "Smaller RLZ-compressed suffix arrays"
Danyang Ma, Simon J. Puglisi, Rajeev Raman & Bella Zhokova, "On Elias-Fano for Rank Queries in FM-Indexes"
November 2020
Lauri Heino receives his MSc degree
September 2020
Pekka Jylha-Ollila receives his MSc degree
July 2020
Jussi Timonen, Antti Karjalainen, and Risto Haapasalmi receive their MSc degrees
Bella and Simon have paper "Relative Lempel-Ziv compression of suffix array" accepted to SPIRE 2020
May 2020
Simon is opponent for Florian Kurpicz's PhD thesis defence at TU Dortmund
March 2020
Two papers accepted to SEA 2020 in Palermo
February 2020
Simon attending London Stringology Days at King's College London
January 2020
Bella presenting "Fast Indexes for Gapped Pattern Matching" at SOFSEM 2020 in Cyprus
December 2019
Simon visiting Yasuo Tabei and Hideo Bannai at RIKEN AIP Tokyo
Simon visiting Alistair Moffat and Joel MacKenzie at U. Melbourne
November 2019
Dustin Cobas visiting from U. Chile
October 2019
Simon co-chairing (with Nieves Brisaboa) SPIRE 2019 conference in Segovia, Spain
Bella attending SPIRE 2019 and WCTA 2019 in Segovia, Spain
September 2019
Javier Soto visiting from U. Concepcion
August 2019
Mabel Vidal visiting from U. Concepcion
July 2019
Rajeev Raman visiting from U. Leicester
June 2019
Massimiliano Rossi visiting from U. Verona
May 2019
Simon visiting Rayan Chikhi's group at Institute Pasteur in Paris
Simon visiting Golnaz Badkobeh at Goldsmiths University of London
Rayan Chikhi and Camille Marchet visiting from Institute Pasteur in Paris for Helsinki Bioinformatics Day
Sara Giuliani starting as a summer research intern
Uula Ulkuniemi starting us as a summer research intern