1 citations · 1 across the 5 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Efficient Enumeration of Enclosed Vector Spaces
Anna Bernasconi, Valentina Ciriani, Alessio Conte +2
In this paper, we address several problems concerning vector spaces enclosed in a given set. Let V be a vector space over a finite field of cardinality c, and let b…
cs.DS2026
Variations on the Problem of Identifying Spectrum-Preserving String Sets
Sankardeep Chakraborty, Roberto Grossi, Ren Kimura +3
In computational genomics, many analyses rely on efficient storage and traversal of -mers, motivating compact representations such as spectrum-preserving string sets (SPSS), whi…
cs.DS2026
Revisiting the Sparse Matrix Compression Problem
Vincent Jugé, Dominik Köppl, Vincent Limouzy +4
The sparse matrix compression problem asks for a one-dimensional representation of a binary matrix, formed by an integer array of row indices and a shift function f…