23 citations · 50 across the 12 of their papers we have counts for
13 papers
Augmented Thresholds for MONI
César Martínez-Guardiola, Nathaniel K. Brown, Fernando Silva-Coira +3
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 thi…
ViQUF: de novo Viral Quasispecies reconstruction using Unitig-based Flow networks
Borja Freire, Susana Ladra, José R. Paramá +1
During viral infection, intrahost mutation and recombination can lead to significant evolution, resulting in a population of viruses that harbor multiple haplotypes. The task of re…
GeoSP: A parallel method for a cortical surface parcellation based on geodesic distance
Narciso López-López, Andrea Vázquez, Cyril Poupon +3
We present GeoSP, a parallel method that creates a parcellation of the cortical mesh based on a geodesic distance, in order to consider gyri and sulci topology. The method represen…
Compressed Data Structures for Binary Relations in Practice
Carlos Quijada-Fuentes, Miguel R. Penabad, Susana Ladra +1
Binary relations are commonly used in Computer Science for modeling data. In addition to classical representations using matrices or lists, some compressed data structures have rec…
Space- and Time-Efficient Storage of LiDAR Point Clouds
Susana Ladra, Miguel R. Luaces, José R. Paramá +1
LiDAR devices obtain a 3D representation of a space. Due to the large size of the resulting datasets, there already exist storage methods that use compression and present some prop…
On dynamic succinct graph representations
Miguel E. Coimbra, Alexandre P. Francisco, Luís M. S. Russo +3
We address the problem of representing dynamic graphs using -trees. The -tree data structure is one of the succinct data structures proposed for representing static graph…
Efficient processing of raster and vector data
Fernando Silva-Coira, José R. Paramá, Susana Ladra +2
In this work, we propose a framework to store and manage spatial data, which includes new efficient algorithms to perform operations accepting as input a raster dataset and a vecto…
Energy consumption in compact integer vectors: A study case
José Fuentes-Sepúlveda, Susana Ladra
In the field of algorithms and data structures analysis and design, most of the researchers focus only on the space/time trade-off, and little attention has been paid to energy con…
Compact and Efficient Representation of General Graph Databases
Sandra Álvarez-García, Borja Freire, Susana Ladra +1
In this paper, we propose a compact data structure to store labeled attributed graphs based on the k2-tree, which is a very compact data structure designed to represent a simple di…
About BIRDS project (Bioinformatics and Information Retrieval Data Structures Analysis and Design)
Guillermo de Bernardo, Susana Ladra
BIRDS stands for "Bioinformatics and Information Retrieval Data Structures analysis and design" and is a 4-year project (2016--2019) that has received funding from the European Uni…
Exploiting Computation-Friendly Graph Compression Methods
Alexandre P. Francisco, Travis Gagie, Susana Ladra +1
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,…
Handwritten character recognition using some (anti)-diagonal structural features
José Manuel Casas, Nick Inassaridze, Manuel Ladra +1
In this paper, we present a methodology for off-line handwritten character recognition. The proposed methodology relies on a new feature extraction technique based on structural ch…
Faster Compressed Quadtrees
Guillermo de Bernardo, Travis Gagie, Susana Ladra +2
Real-world point sets tend to be clustered, so using a machine word for each point is wasteful. In this paper we first show how a compact representation of quadtrees using $\Oh{1}$…