http://dspace.infodocu.lbd.org.es/xmlui/handle/123456789/1374 Publicaciónes relacionadas con Bioinformática Fri, 22 May 2026 19:04:23 GMT 2026-05-22T19:04:23Z http://dspace.infodocu.lbd.org.es/xmlui/handle/123456789/1419 Compresión de textos en Bases de Datos Digitales R.Brisaboa, Nieves; Iglesias, E.L.; Navarro, G.; Parmá, J.R. Este trabajo presenta una revisi´on de los m´etodos de compresi´on de textos, que permiten la busqueda ´ directa de palabras y frases dentro del texto sin necesidad de descomprimirlo. Se presentan las t´ecnicas de compresi´on basadas en Huffman y dos t´ecnicas m´as recientes: el m´etodo Denso con Post-Etiquetado y el m´etodo (s,c)-Denso. Adem´as se muestra como estos nuevos m´etodos son directamente comparables, en tasa de compresi´on, con las t´ecnicas basadas en Huffman y c´omo proporcionan una compresi´on m´as simple y r´apida, manteniendo sus caracter´ısticas m´as interesantes. De este modo estas nuevas t´ecnicas son extremadamente adecuadas para la compresi´on de textos sobre los que haya que realizar operaciones de Text Retrieval, pues facilita la indexaci´on y preprocesado de los mismos sin necesidad de descomprimirlos. Wed, 01 Jan 2003 00:00:00 GMT http://dspace.infodocu.lbd.org.es/xmlui/handle/123456789/1419 2003-01-01T00:00:00Z http://dspace.infodocu.lbd.org.es/xmlui/handle/123456789/1406 Competitive author profiling using compression-based strategies Claude, Francisco; Galaktionov, Daniv; Konow, Roberto; Ladra, Susana; Pedreira, Óscar In this paper we address the problem by using several compression-inspired strategiesthat generate different models without analyzing or extracting specific features from thetextual content, making them style-oblivious approaches. We analyze the behavior ofthese techniques, combine them and compare them with other state-of-the-art methods.We show that they can be competitive in terms of accuracy, giving the best predictionsfor some domains, and they are efficient in time performance. Tue, 01 Jan 2019 00:00:00 GMT http://dspace.infodocu.lbd.org.es/xmlui/handle/123456789/1406 2019-01-01T00:00:00Z http://dspace.infodocu.lbd.org.es/xmlui/handle/123456789/1403 Compact and Efficient Representation of General Graph Databases1.0 Álvarez-García, Sandra; Freire, Borja; Ladra, Susana; Pedreira, Óscar In this paper, we propose a compact data structure to store labeled at-tributed graphs based on thek2-tree, which is a very compact data structure designedto represent a simple directed graph. The idea we propose can be seen as an extension ofthek2-tree to support property graphs. In addition to the static approach, we also pro-pose a dynamic version of the storage representation, which allows flexible schemas andinsertion or deletion of data. We provide an implementation of a basic set of operations,which can be combined to form complex queries over these graphs with attributes. Weevaluate the performance of our proposal with existing graph database systems andprove that our compact attributed graph representation obtains also competitive timeresults. Tue, 01 Jan 2019 00:00:00 GMT http://dspace.infodocu.lbd.org.es/xmlui/handle/123456789/1403 2019-01-01T00:00:00Z http://dspace.infodocu.lbd.org.es/xmlui/handle/123456789/1402 GraCT: A Grammar based Compressedrepresentation of Trajectories Nieves R., Brisaboa; Gómez-Brandón, Adrián; Navarro, Gonzalo; R.Paramá, José We present a compressed data structure to store free tra-jectories of moving objects (ships over the sea, for example) allowingspatio-temporal queries. Our method, GraCT, uses ak2-tree to store theabsolute positions of all objects at regular time intervals(snapshots),whereas the positions between snapshots are represented aslogs of rela-tive movements compressed with Re-Pair. Our experimental evaluationshows important savings in space and time with respect to a fair baseline Tue, 01 Jan 2019 00:00:00 GMT http://dspace.infodocu.lbd.org.es/xmlui/handle/123456789/1402 2019-01-01T00:00:00Z