Buscar
Mostrando ítems 1-9 de 9
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 ...
Compressed suffix trees for repetitive collections based on block trees
(Universidad de Chile, 2019)
The Block Tree is a recently proposed data structure representing a sequence T of length n in space bounded by the number of phrases z of the Lempel-Ziv parsing of T. It uses O(z log(n/z)) space and supports access to ...
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 ...
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 ...
Approximate String Matching with Compressed Indexes
(2009)
A compressed full-text self-index for a text T is a data structure requiring reduced
space and able to search for patterns P in T. It can also reproduce any substring of T, thus
actually replacing T. Despite the recent ...