Results 171 to 180 of about 37,210 (201)

Suffix Trees and Arrays

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

Property Suffix Array with Applications in Indexing Weighted Sequences

Journal of Experimental Algorithmics, 2020
Panagiotis Charalampopoulos, Costas S Iliopoulos, Solon P Pissis   +2 more
exaly  

On the Optimisation of the GSACA Suffix Array Construction Algorithm

Lecture Notes in Computer Science, 2022
Jannik Olbrich, Enno Ohlebusch, Thomas Büchler   +2 more
exaly  

Secure Compressed Suffix Arrays.

This paper proposes a secure compressed suffix array, which is a data oblivious and compressed version of the suffix array used for finding substrings of a large string. Secure compressed suffix arrays can be used for indexing a large collection of strings containing personal information such as DNA data.
openaire   +2 more sources

Suffix Trees and Suffix Arrays

2004
openaire   +2 more sources

A taxonomy of suffix array construction algorithms

ACM Computing Surveys, 2007
Simon J Puglisi, W F Smyth
exaly  

Linear work suffix array construction

Journal of the ACM, 2006
Juha Kärkkäinen, Peter Sanders
exaly  

Suffix Array Construction in External Memory Using D-Critical Substrings

ACM Transactions on Information Systems, 2014
Ge Nong, Wai Hong Chan
exaly  

Suffix arrays

2020
openaire   +1 more source

Suffix array and Lyndon factorization of a text

Journal of Discrete Algorithms, 2014
Sabrina Mantaci, Antonio Restivo, Giovanna Rosone   +2 more
exaly