Browsing by Author "Navarro, Gonzalo"
Now showing items 1-19 of 19
-
(Taylor & Francis, 2020)As the number of vehicles and devices equipped with GPS technology has grown explosively, an urgent need has arisen for time- and space-efficient data structures to represent their trajectories. The most commonly desired ...
-
(World Scientific Publishing Co. Pte Ltd, 2019)Signaling pathways are responsible for the regulation of cell processes, such as monitoring the external environment, transmitting information across membranes, and making cell fate decisions. Given the increasing amount ...
-
(Springer, 2020)In the range alpha-majority query problem, we are given a sequence S[1 horizontal ellipsis n] and a fixed threshold alpha is an element of(0,1), and are asked to preprocess S such that, given a query range [i horizontal ...
-
(Springer, 2017-06)Most of the fastest-growing string collections today are repetitive, that is, most of the constituent documents are similar to many others. As these collections keep growing, a key approach to handling them is to exploit ...
-
(ASSOC COMPUTING MACHINERY, 2008-06)Given a sequence of n bits with binary zero-order entropy H0, we present a dynamic data structure that requires nH0 + o(n) bits of space, which is able of performing rank and select, as well as inserting and deleting ...
-
(Universidad de Chile, 1998)
-
(2014-01-08)We design a succinct full-text index based on the idea of Huffman-compressing the text and then applying the Burrows-Wheeler transform over it. The resulting structure can be searched as an FM-index, with the benefit of ...
-
(2009)Similarity searching in metric spaces has a vast number of applications in several fields like multimedia databases, text retrieval, computational biology, and pattern recognition. In this context, one of the most important ...
-
(Springer, 2020)Lempel-Ziv (LZ77 or, briefly, LZ) is one of the most effective and widely-used compressors for repetitive texts. However, the existing efficient methods computing the exact LZ parsing have to use linear or close to linear ...
-
(Elsevier, 2015)Proximity searching is the problem of retrieving,from a given database, those objects closest to a query.To avoid exhaustive searching,data structures called indexes are builton the database prior to serving queries.The ...
-
(JOHN WILEY, 2008-11-10)Semistatic byte-oriented word-based compression codes have been shown to be an attractive alternative to compress natural language text databases, because of the combination of speed, effectiveness, and direct searchability ...
-
(JOHN WILEY, 2006-08)Hydrophobic interaction chromatography (HIC) is an important technique for the purification of proteins. In this paper, we review three different approaches for predicting protein retention time in HIC, based either on a ...
-
(Elsevier, 2014)We address the problem of indexing a collection D = f T 1 ; T 2 ;::: T D g of D string documents of total length n , so that we can e ciently answer top-k queries : retrieve k documents most ...
-
(Elsevier Ltd, 2019)This work introduces a companion reproducible paper with the aim of allowing the exact replication of the methods, experiments, and results discussed in a previous work Claude et al., (2016). In that parent paper, we ...
-
(Springer, 2016)We study the problem of designing a data structure that reports the positions of the distinct τ -majorities within any range of an array A[1, n], without storing A. A τ -majority in a range A[i, j ], for 0 < τ < 1, is ...
-
(ACM, 2015)Sequence representations supporting the queries access, select, and rank are at the core of many data structures. There is a considerable gap between the various upper bounds and the few lower bounds known for such ...
-
(Elsevier, 2016)The need to store and query a set of strings - a string dictionary - arises in many kinds of applications. While classically these string dictionaries have accounted for a small share of the total space budget (e.g., in ...
-
(Assoc Computing Machinery, USA, 2020)The predecessor problem is a key component of the fundamental sorting-and-searching core of algorithmic problems. While binary search is the optimal solution in the comparison model, more realistic machine models on integer ...
-
(BMC, 2022)Background: Recently, extensive cancer genomic studies have revealed mutational and clinical data of large cohorts of cancer patients. For example, the Pan‑Lung Cancer 2016 dataset (part of The Cancer Genome Atlas project), ...
