Massimiliano Rossi

Orcid: 0000-0002-3012-1394

Affiliations:
  • University of Florida, Gainesville, FL, USA
  • University of Verona, Italy (former)


According to our database1, Massimiliano Rossi authored at least 27 papers between 2015 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
μ- PBWT: a lightweight r-indexing of the PBWT for storing and querying UK Biobank data.
Bioinform., September, 2023

Data Structures for SMEM-Finding in the PBWT.
Proceedings of the String Processing and Information Retrieval, 2023

LZ77 via Prefix-Free Parsing.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Finding Overlapping Rmaps via Clustering.
IEEE ACM Trans. Comput. Biol. Bioinform., 2022

MONI: A Pangenomic Index for Finding Maximal Exact Matches.
J. Comput. Biol., 2022

Finding Maximal Exact Matches Using the r-Index.
J. Comput. Biol., 2022

Computing Maximal Unique Matches with the r-Index.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

RLBWT Tricks.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Accessing the Suffix Array via φ <sup>-1</sup>-Forest.
Proceedings of the String Processing and Information Retrieval, 2022

CSTs for Terabyte-Sized Data.
Proceedings of the Data Compression Conference, 2022

2021
On infinite prefix normal words.
Theor. Comput. Sci., 2021

Pattern Discovery in Colored Strings.
ACM J. Exp. Algorithmics, 2021

Fast and efficient Rmap assembly using the Bi-labelled de Bruijn graph.
Algorithms Mol. Biol., 2021

Computing the Original eBWT Faster, Simpler, and with Less Memory.
Proceedings of the String Processing and Information Retrieval, 2021

r-Indexing the eBWT.
Proceedings of the String Processing and Information Retrieval, 2021

On the Redundancy of D-Ary Fano Codes.
Proceedings of the SOFSEM 2021: Theory and Practice of Computer Science, 2021

Efficiently Merging r-indexes.
Proceedings of the 31st Data Compression Conference, 2021

PHONI: Streamed Matching Statistics with Multi-Genome References.
Proceedings of the 31st Data Compression Conference, 2021

PFP Compressed Suffix Trees.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2021

2020
On the multi-interval Ulam-Rényi game: For 3 lies 4 intervals suffice.
Theor. Comput. Sci., 2020

PFP Data Structures.
CoRR, 2020

Tailoring r-index for metagenomics.
CoRR, 2020

Tailoring r-index for Document Listing Towards Metagenomics Applications.
Proceedings of the String Processing and Information Retrieval, 2020

2019
Greedy additive approximation algorithms for minimum-entropy coupling problem.
Proceedings of the IEEE International Symposium on Information Theory, 2019

On Lempel-Ziv Decompression in Small Space.
Proceedings of the Data Compression Conference, 2019

2018
Bubble-Flip - A new generation algorithm for prefix normal words.
Theor. Comput. Sci., 2018

2015
Embedded system for a Ballbot robot.
Proceedings of the 12th International Workshop on Intelligent Solutions in Embedded Systems, 2015


  Loading...