Results 151 to 160 of about 301,848 (186)
Some of the next articles are maybe not open access.
2000
Suffix array is a data structure that can be used to index a large text file so that queries of its content can be answered quickly. Basically a suffix array is an array of all suffixes of the text in the lexicographic order. Whether or not a word occurs in the text can be answered in logarithmic time by binary search over the suffix array.
openaire +1 more source
Suffix array is a data structure that can be used to index a large text file so that queries of its content can be answered quickly. Basically a suffix array is an array of all suffixes of the text in the lexicographic order. Whether or not a word occurs in the text can be answered in logarithmic time by binary search over the suffix array.
openaire +1 more source
Data Compression Conference (dcc 2008), 2008
DCA (Data Compression using Antidictionaries) is a novel lossless data compression method working on bit streams presented by Crochemore et al. DCA takes advantage of words that do not occur as factors in the text, i.e. that are forbidden. Due to these forbidden words (antiwords), some symbols in the text can be predicted.
Martin Fiala, Jan Holub 0001
openaire +2 more sources
DCA (Data Compression using Antidictionaries) is a novel lossless data compression method working on bit streams presented by Crochemore et al. DCA takes advantage of words that do not occur as factors in the text, i.e. that are forbidden. Due to these forbidden words (antiwords), some symbols in the text can be predicted.
Martin Fiala, Jan Holub 0001
openaire +2 more sources
Sampled suffix array with minimizers
Software: Practice and Experience, 2017SummarySampling (evenly) the suffixes from the suffix array is an old idea trading the pattern search time for reduced index space. A few years ago Claudeet al.showed an alphabet sampling scheme allowing for more efficient pattern searches compared with the sparse suffix array, for long enough patterns.
Szymon Grabowski, Marcin Raniszewski
openaire +1 more source
Suffix Array for Large Alphabet
Data Compression Conference (dcc 2008), 2008Burrows-Wheeler Transform (BWT) is used as the main part in block compression which has a good balance of speed and compression ratio. Suffix arrays are used in the coding phase of BWT and we focus on creating them for an alphabet larger than 256 symbols. The motivation for this work has been software project XBW-an application for compression of large
Radovan Sesták +2 more
openaire +2 more sources
Compressed Compact Suffix Arrays
2004The compact suffix array (CSA) is a space-efficient full-text index, which is fast in practice to search for patterns in a static text. Compared to other compressed suffix arrays (Grossi and Vitter, Sadakane, Ferragina and Manzini), the CSA is significantly larger (2.7 times the text size, as opposed to 0.6–0.8 of compressed suffix arrays).
Veli Mäkinen, Gonzalo Navarro 0001
openaire +1 more source
Property Suffix Array with Applications
2018The suffix array is one of the most prevalent data structures for string indexing; it stores the lexicographically sorted list of suffixes of a given string. Its practical advantage compared to the suffix tree is space efficiency. In Property Indexing, we are given a string x of length n and a property \(\varPi \), i.e.
Panagiotis Charalampopoulos +3 more
openaire +2 more sources
Distributed generation of suffix arrays
1997An algorithm for the distributed computation of suffix arrays for large texts is presented. The parallelism model is that of a set of sequential tasks which execute in parallel and exchange messages among them. The underlying architecture is that of a high bandwidth network of processors.
Gonzalo Navarro 0001 +3 more
openaire +2 more sources
2011
Gapped suffix arrays (also known as bi-factor arrays) were recently presented for approximate searching under the Hamming distance. These structures can be used to find occurrences of a pattern P, where the characters inside a gap do not have to match. This paper describes a succinct representation of gapped suffix arrays.
Luís M. S. Russo, German Tischler
openaire +1 more source
Gapped suffix arrays (also known as bi-factor arrays) were recently presented for approximate searching under the Hamming distance. These structures can be used to find occurrences of a pattern P, where the characters inside a gap do not have to match. This paper describes a succinct representation of gapped suffix arrays.
Luís M. S. Russo, German Tischler
openaire +1 more source
Suffix cactus: A cross between suffix tree and suffix array
1995The suffix cactus is a new alternative to the suffix tree and the suffix array as an index of large static texts. Its size and its performance in searches lies between those of the suffix tree and the suffix array. Structurally, the suffix cactus can be seen either as a compact variation of the suffix tree or as an augmented suffix array.
openaire +2 more sources
Transformation of Suffix Arrays into Suffix Trees on the MPI Environment
2007Suffix trees and suffix arrays are two well-known index data structures for strings. It is known that the latter can be easily transformed into the former: Iliopoulos and Rytter [5] showed two simple transformation algorithms on the CREW PRAM model. However, the PRAM model is a theoretical one and we need a practical parallel model. The Message Passing
Inbok Lee +2 more
openaire +1 more source