References

Groot Koerkamp, R. & Martayan, I. (2025) SimdMinimizers: Computing Random Minimizers, fast. 23rd international symposium on experimental algorithms (SEA 2025), vol. 338. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Ingels, F., Martayan, I., Salson, M., & Marchet, C. (2024) Constrained enumeration of k-mers from a collection of references with metadata. bioRxiv, DOI: 10.1101/2024.05.26.595967.

Ingels, F., Robidou, L., Martayan, I., Marchet, C., & Limasset, A. (2025) Minimizer density revisited: Models and multiminimizers. bioRxiv, DOI: 10.1101/2025.11.21.689688.

Langdale, G. & Lemire, D. (2019) Parsing gigabytes of JSON per second. The VLDB Journal, 28, 941–960.

Martayan, I., Cazaux, B., Limasset, A., & Marchet, C. (2024) Conway-Bromage-Lyndon (CBL): an exact, dynamic representation of k-mer sets. Bioinformatics, DOI: 10.1093/bioinformatics/btae217.

Martayan, I., Robidou, L., Shibuya, Y., & Limasset, A. (2025) Hyper-k-mers: Efficient streaming k-mers representation. Research in computational molecular biology (RECOMB 2025). Springer Nature Switzerland.

Martayan, I., Vandamme, L., Constantinides, B., Cazaux, B., Paperman, C., & Limasset, A. (2025) Accelerating k-mer-based sequence filtering. bioRxiv, DOI: 10.1101/2025.06.16.659853.

Rouzé, T., Martayan, I., Marchet, C., & Limasset, A. (2023) Fractional Hitting Sets for Efficient and Lightweight Genomic Data Sketching. 23rd international workshop on algorithms in bioinformatics (WABI 2023), vol. 273. Schloss Dagstuhl – Leibniz-Zentrum für Informatik.

Rouzé, T., Martayan, I., Marchet, C., & Limasset, A. (2025) Fractional hitting sets for efficient multiset sketching. Algorithms for Molecular Biology, 20, 1.

Smith, C., Martayan, I., Limasset, A., & Dufresne, Y. (2024) Brisk: Exact resource-efficient dictionary for k-mers. bioRxiv, DOI: 10.1101/2024.11.26.625346.