4 citations · 4 across the 3 of their papers we have counts for
6 papers · 1 filter
Grammar Compression By Induced Suffix Sorting
Daniel S. N. Nunes, Felipe A. Louza, Simon Gog +2
A grammar compression algorithm, called GCIS, is introduced in this work. GCIS is based on the induced suffix sorting algorithm SAIS, presented by Nong et al. in 2009. The proposed…
Algorithms to compute the Burrows-Wheeler Similarity Distribution
Felipe A. Louza, Guilherme P. Telles, Simon Gog +1
The Burrows-Wheeler transform (BWT) is a well studied text transformation widely used in data compression and text indexing. The BWT of two strings can also provide similarity meas…
A Grammar Compression Algorithm based on Induced Suffix Sorting
Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog +2
We introduce GCIS, a grammar compression algorithm based on the induced suffix sorting algorithm SAIS, introduced by Nong et al. in 2009. Our solution builds on the factorization p…
CSA++: Fast Pattern Search for Large Alphabets
Simon Gog, Alistair Moffat, Matthias Petri
Indexed pattern search in text has been studied for many decades. For small alphabets, the FM-Index provides unmatched performance, in terms of both space required and search speed…
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays
Simon Gog, Alistair Moffat, J. Shane Culpepper +2
The suffix array is an efficient data structure for in-memory pattern search. Suffix arrays can also be used for external-memory pattern search, via two-level structures that use a…
Lightweight LCP-Array Construction in Linear Time
Simon Gog, Enno Ohlebusch
The suffix tree is a very important data structure in string processing, but it suffers from a huge space consumption. In large-scale applications, compressed suffix trees (CSTs) a…