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 | 481 | 2014 |
Optimized Succinct Data Structures for Massive Data S Gog, M Petri Software Practice and Experience, 2013 | 115 | 2013 |
Cst++ E Ohlebusch, J Fischer, S Gog String Processing and Information Retrieval: 17th International Symposium …, 2010 | 79 | 2010 |
Computing matching statistics and maximal exact matches on compressed full-text indexes E Ohlebusch, S Gog, A Kügel String Processing and Information Retrieval: 17th International Symposium …, 2010 | 65 | 2010 |
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 | 60 | 2013 |
Lempel-Ziv factorization revisited E Ohlebusch, S Gog Annual Symposium on Combinatorial Pattern Matching, 15-26, 2011 | 58 | 2011 |
Inducing enhanced suffix arrays for string collections FA Louza, S Gog, GP Telles Theoretical Computer Science 678, 22-39, 2017 | 52 | 2017 |
Fast and lightweight LCP-array construction algorithms S Gog, E Ohlebusch 2011 Proceedings of the Thirteenth Workshop on Algorithm Engineering and …, 2011 | 48 | 2011 |
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 | 45 | 2012 |
Bidirectional search in a string with wavelet trees T Schnattinger, E Ohlebusch, S Gog Combinatorial Pattern Matching: 21st Annual Symposium, CPM 2010, New York …, 2010 | 39 | 2010 |
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 | 38 | 2010 |
A compressed enhanced suffix array supporting fast string matching E Ohlebusch, S Gog International Symposium on String Processing and Information Retrieval, 51-62, 2009 | 36 | 2009 |
Compressed suffix trees: design, construction, and applications S Gog Universität Ulm, 2011 | 35 | 2011 |
Space-efficient construction of the Burrows-Wheeler transform T Beller, M Zwerger, S Gog, E Ohlebusch String Processing and Information Retrieval: 20th International Symposium …, 2013 | 29 | 2013 |
Fixed block compression boosting in FM-indexes: Theory and practice S Gog, J Kärkkäinen, D Kempa, M Petri, SJ Puglisi Algorithmica 81, 1370-1391, 2019 | 28 | 2019 |
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 | 28 | 2013 |
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 | 26 | 2016 |
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 | 26 | 2013 |
A grammar compression algorithm based on induced suffix sorting DSN Nunes, F Louza, S Gog, M Ayala-Rincón, G Navarro 2018 Data Compression Conference, 42-51, 2018 | 22 | 2018 |
Relative FM-indexes D Belazzougui, T Gagie, S Gog, G Manzini, J Sirén String Processing and Information Retrieval: 21st International Symposium …, 2014 | 20 | 2014 |