4 citations · 4 across the 2 of their papers we have counts for
3 papers
cs.DS2016
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…
cs.DS2013
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…
cs.DS2010★ 4 cited
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…