Buscar
Mostrando ítems 1-10 de 1179
Document retrieval on repetitive string collections
(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 ...
Fully functional suffix trees and optimal text searching in BWT-Runs bounded space
(Assoc Computing Machinery, USA, 2020)
Indexing highly repetitive texts-such as genomic databases, software repositories and versioned text collections-has become an important problem since the turn of the millennium. A relevant compressibility measure for ...
Universal indexes for highly repetitive document collections
(Pergamon-Elsevier, 2016)
Indexing highly repetitive collections has become a relevant problem with the emergence of large repositories of versioned documents, among other applications. These Collections may reach huge sizes, but are formed mostly ...
La repetición rítmica como alternativa a la repetición espaciada: un estudio piloto
(Universidad Católica de Pereira, 2017)
Uso de repetição espaçada na graduação em medicina: memorial do estudante acerca de técnicas de estudo
(Universidade Federal de São CarlosUFSCarCâmpus São CarlosMedicina - Med, 2021-12-22)
Medical school in Federal University of São Carlos (UFSCar) aims, as one of its objectives,
to develop the student’s ability to learn how to learn. Although the collective part of this
proposal is extensively explored, ...
Relative Suffix Trees
(The British Computer Society, 2018-05)
Suffix trees are one of the most versatile data structures in stringology, with many applications in bioinformatics. Their main drawback is their size, which can be tens of times larger than the input sequence. Much effort ...
Tower systems for linearly repetitive Delone sets
(CAMBRIDGE UNIV PRESS, 2011)
In this paper we study linearly repetitive Delone sets and prove, following the work of Bellissard, Benedetti and Gambaudo, that the hull of a linearly repetitive Delone set admits a properly nested sequence of box ...
Universal compressed text indexing
(Elsevier, 2019)
The rise of repetitive datasets has lately generated a lot of interest in compressed self-indexes based on dictionary compression, a rich and heterogeneous family of techniques that exploits text repetitions in different ...
Grammar compressed sequences with rank/select support
(Elsevier, 2017)
Sequence representations supporting not only direct access to their symbols, but also rank/select operations, are a fundamental building block in many compressed data structures. Several recent applications need to represent ...