Results 131 to 140 of about 735,070 (175)
A taxonomy of suffix array construction algorithms
ACM Computing Surveys, 2007 In 1990, Manber and Myers proposed suffix arrays as a space-saving alternative to suffix trees and described the first algorithms for suffix array construction and use.
Simon Puglisi, W F Smyth
exaly +4 more sources
Engineering a Lightweight Suffix Array Construction Algorithm
Algorithmica, 2004 We consider the problem of computing the suffix array of a text T [1,n]. This problem consists in sorting the suffixes of T in lexicographic order. The suffix array [16] (orpat array [9]) is a simple, easy to code, and elegant data structure used for ...
Giovanni Manzini, Paolo Ferragina
exaly +2 more sources
Property Suffix Array with Applications in Indexing Weighted Sequences
Journal of Experimental Algorithmics, 2020 The 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.
Solon Pissis +2 more
exaly +2 more sources
Suffix array and Lyndon factorization of a text [PDF]
Journal of Discrete Algorithms, 2014 The main goal of this paper is to highlight the relationship between the suffix array of a text and its Lyndon factorization. It is proved in [15] that one can obtain the Lyndon factorization of a text from its suffix array.
Giovanna Rosone +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
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
J. Autom. Lang. Comb., 2003
We introduce quasi suffix arrays as a generalization of suffix arrays for character strings. We show that a quasi suffix array encodes enough of the structure of the string to be a useful construct for many applications where the full power of suffix arrays is not necessary, notably in problems that do not require lexicographical order, for example ...
Frantisek Franek +3 more
openaire +2 more sources
We introduce quasi suffix arrays as a generalization of suffix arrays for character strings. We show that a quasi suffix array encodes enough of the structure of the string to be a useful construct for many applications where the full power of suffix arrays is not necessary, notably in problems that do not require lexicographical order, for example ...
Frantisek Franek +3 more
openaire +2 more sources
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
Computing suffix links for suffix trees and arrays
Information Processing Letters, 2007zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
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