Results 121 to 130 of about 14,384 (164)
Some of the next articles are maybe not open access.
Dynamic Generalized Suffix Arrays
Applied Mechanics and Materials, 2012Document retrieval is the basic task of search engines, and seize amount of attention by the pattern matching community. In this paper, we focused on the dynamic version of this problem, in which the text insertion and deletion is allowable. By using the generalized suffix array and other data structure, we proposed a new index structure.
Song Feng Lu, Hua Zhao
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
openaire +1 more source
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
openaire +1 more source
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
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
openaire +1 more source
2007
Surprisingly enough, it is not yet known how to build directly a suffix array that indexes just the k positions at word-boundaries of a text T[1, n], taking O(n) time and O(k) space in addition to T. We propose a class-note solution to this problem that achieves such optimal time and space bounds.
FERRAGINA, PAOLO, FISCHER J.
openaire +1 more source
Surprisingly enough, it is not yet known how to build directly a suffix array that indexes just the k positions at word-boundaries of a text T[1, n], taking O(n) time and O(k) space in addition to T. We propose a class-note solution to this problem that achieves such optimal time and space bounds.
FERRAGINA, PAOLO, FISCHER J.
openaire +1 more source
2014
The suffix tree is one of the oldest full-text inverted indexes and one of the most persistent subjects of study in the theory of algorithms. With extensions and refinements, including succinct and compressed variants that provide some of its expressive power in smaller space, it constitutes a fundamental conceptual tool in the design of string ...
Alberto Apostolico, Fabio Cunial
openaire +1 more source
The suffix tree is one of the oldest full-text inverted indexes and one of the most persistent subjects of study in the theory of algorithms. With extensions and refinements, including succinct and compressed variants that provide some of its expressive power in smaller space, it constitutes a fundamental conceptual tool in the design of string ...
Alberto Apostolico, Fabio Cunial
openaire +1 more source
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
Engineering a Lightweight Suffix Array Construction Algorithm
Algorithmica, 2002zbMATH Open Web Interface contents unavailable due to conflicting licenses.
G. MANZINI, FERRAGINA, PAOLO
openaire +6 more sources
Computing all Repeats Using Suffix Arrays
2003We describe an algorithm that identifies all the repeating substrings (tandem, overlapping, and split) in a given string $x = x[1...n]$. Given the suffix arrays of $x$ and of the reversed string $\hat{x}$, the algorithm requires $\Theta(n)$ time for its execution and represents its output in $\Theta(n)$ space, either as a reduced suffix array ...
Franěk, F., Smyth, W.F., Tang, Y.
openaire +2 more sources
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 +1 more source