18 citations · 35 across the 8 of their papers we have counts for
10 papers
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…
Efficient and Effective Query Auto-Completion
Simon Gog, Giulio Ermanno Pibiri, Rossano Venturini
Query Auto-Completion (QAC) is an ubiquitous feature of modern textual search systems, suggesting possible ways of completing the query being typed by the user. Efficiency is cruci…
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…
Scalable Construction of Text Indexes
Timo Bingmann, Simon Gog, Florian Kurpicz
The suffix array is the key to efficient solutions for myriads of string processing problems in different applications domains, like data compression, data mining, or Bioinformatic…
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…