Published in: LIPIcs, Volume 351, 33rd Annual European Symposium on Algorithms (ESA 2025)
Md. Hasin Abrar, Paul Medvedev, and Giorgio Vinciguerra. Efficiency of Learned Indexes on Genome Spectra. In 33rd Annual European Symposium on Algorithms (ESA 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 351, pp. 18:1-18:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)
@InProceedings{abrar_et_al:LIPIcs.ESA.2025.18, author = {Abrar, Md. Hasin and Medvedev, Paul and Vinciguerra, Giorgio}, title = {{Efficiency of Learned Indexes on Genome Spectra}}, booktitle = {33rd Annual European Symposium on Algorithms (ESA 2025)}, pages = {18:1--18:18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-395-9}, ISSN = {1868-8969}, year = {2025}, volume = {351}, editor = {Benoit, Anne and Kaplan, Haim and Wild, Sebastian and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2025.18}, URN = {urn:nbn:de:0030-drops-244865}, doi = {10.4230/LIPIcs.ESA.2025.18}, annote = {Keywords: Genome spectra, piecewise linear approximation, learned index, k-mers} }
Published in: LIPIcs, Volume 274, 31st Annual European Symposium on Algorithms (ESA 2023)
Paolo Ferragina, Hans-Peter Lehmann, Peter Sanders, and Giorgio Vinciguerra. Learned Monotone Minimal Perfect Hashing. In 31st Annual European Symposium on Algorithms (ESA 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 274, pp. 46:1-46:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023)
@InProceedings{ferragina_et_al:LIPIcs.ESA.2023.46, author = {Ferragina, Paolo and Lehmann, Hans-Peter and Sanders, Peter and Vinciguerra, Giorgio}, title = {{Learned Monotone Minimal Perfect Hashing}}, booktitle = {31st Annual European Symposium on Algorithms (ESA 2023)}, pages = {46:1--46:17}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-295-2}, ISSN = {1868-8969}, year = {2023}, volume = {274}, editor = {G{\o}rtz, Inge Li and Farach-Colton, Martin and Puglisi, Simon J. and Herman, Grzegorz}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2023.46}, URN = {urn:nbn:de:0030-drops-186990}, doi = {10.4230/LIPIcs.ESA.2023.46}, annote = {Keywords: compressed data structure, monotone minimal perfect hashing, retrieval} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Paolo Ferragina, Giovanni Manzini, and Giorgio Vinciguerra. Repetition- and Linearity-Aware Rank/Select Dictionaries. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 64:1-64:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2021)
@InProceedings{ferragina_et_al:LIPIcs.ISAAC.2021.64, author = {Ferragina, Paolo and Manzini, Giovanni and Vinciguerra, Giorgio}, title = {{Repetition- and Linearity-Aware Rank/Select Dictionaries}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {64:1--64:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.64}, URN = {urn:nbn:de:0030-drops-154974}, doi = {10.4230/LIPIcs.ISAAC.2021.64}, annote = {Keywords: Data compression, Compressed data structures, Entropy} }