Simon Gog
Titel
Citeras av
Citeras av
År
From Theory to Practice: Plug and Play with Succinct Data Structures
S Gog, T Beller, A Moffat, M Petri
Symposium on Experimental Algorithms, 26-337, 2014
2722014
Optimized Succinct Data Structures for Massive Data
S Gog, M Petri
Software Practice and Experience, 2013
772013
Cst++
E Ohlebusch, J Fischer, S Gog
International symposium on string processing and information retrieval, 322-333, 2010
712010
Computing the longest common prefix array based on the Burrows–Wheeler transform
T Beller, S Gog, E Ohlebusch, T Schnattinger
Journal of Discrete Algorithms 18, 22-31, 2013
572013
Computing matching statistics and maximal exact matches on compressed full-text indexes
E Ohlebusch, S Gog, A Kügel
International Symposium on String Processing and Information Retrieval, 347-358, 2010
472010
Lempel-Ziv factorization revisited
E Ohlebusch, S Gog
Annual Symposium on Combinatorial Pattern Matching, 15-26, 2011
422011
Fast and lightweight LCP-array construction algorithms
S Gog, E Ohlebusch
2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and …, 2011
422011
Bidirectional search in a string with wavelet trees and bidirectional matching statistics
T Schnattinger, E Ohlebusch, S Gog
Information and Computation 213, 13-22, 2012
372012
Bidirectional search in a string with wavelet trees
T Schnattinger, E Ohlebusch, S Gog
Annual Symposium on Combinatorial Pattern Matching, 40-50, 2010
362010
A compressed enhanced suffix array supporting fast string matching
E Ohlebusch, S Gog
International Symposium on String Processing and Information Retrieval, 51-62, 2009
342009
Compressed suffix trees: design, construction, and applications
S Gog
Universität Ulm, 2011
332011
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
E Ohlebusch, S Gog
Information Processing Letters 110 (3), 123-128, 2010
282010
Space-efficient construction of the Burrows-Wheeler transform
T Beller, M Zwerger, S Gog, E Ohlebusch
International Symposium on String Processing and Information Retrieval, 5-16, 2013
232013
Large-scale pattern search using reduced-space on-disk suffix arrays
S Gog, A Moffat, JS Culpepper, A Turpin, A Wirth
IEEE transactions on knowledge and data engineering 26 (8), 1918-1931, 2013
232013
Inducing enhanced suffix arrays for string collections
FA Louza, S Gog, GP Telles
Theoretical Computer Science 678, 22-39, 2017
202017
Compressed suffix trees: Efficient computation and storage of LCP-values
S Gog, E Ohlebusch
Journal of Experimental Algorithmics (JEA) 18, 2.1-2.31, 2013
202013
Relative FM-indexes
D Belazzougui, T Gagie, S Gog, G Manzini, J Sirén
International Symposium on String Processing and Information Retrieval, 52-64, 2014
172014
Advantages of shared data structures for sequences of balanced parentheses
S Gog, J Fischer
2010 Data Compression Conference, 406-415, 2010
172010
An improved algorithm for the all-pairs suffix–prefix problem
WHA Tustumi, S Gog, GP Telles, FA Louza
Journal of Discrete Algorithms 37, 34-43, 2016
152016
Improved Single-Term Top-k Document Retrieval
S Gog, G Navarro
ALENEX, 2015
152015
Systemet kan inte utföra åtgärden just nu. Försök igen senare.
Artiklar 1–20