Buscar
Mostrando ítems 1-3 de 3
Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
(Springer, 2016-09-21)
[Abstract] For many kinds of prefix-free codes there are efficient and compact alternatives to the traditional tree-based representation. Since these put the codes into canonical form, however, they can only be used when ...
Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication
(IEEE Computer Society, 2018-03)
[Abstract] Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In ...
Augmented Thresholds for MONI
(Institute of Electrical and Electronics Engineers Inc., 2023)
[Abstract]: MONI (Rossi et al., 2022) can store a pangenomic dataset T in small space and later, given a pattern P, quickly find the maximal exact matches (MEMs) of P with respect to T. In this paper we consider its one-pass ...