How to Achieve an Equivalent Simple Permutation in Linear Time. - Simon Gog; Martin Bader (RECOMB-CG, 2007)

GENESIS: genome evolution scenarios. - Simon Gog; Martin Bader; Enno Ohlebusch (Bioinform., 2008)

Fast Algorithms for Transforming Back and Forth between a Signed Permutation and Its Equivalent Simple Permutation. - Simon Gog; Martin Bader (J. Comput. Biol., 2008)

A Compressed Enhanced Suffix Array Supporting Fast String Matching. - Enno Ohlebusch; Simon Gog (SPIRE, 2009)

Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays. - Simon Gog (SEA, 2009)

Space-efficient Genome Comparisons with Compressed Full-text Indexes. - Enno Ohlebusch; Simon Gog (BICoB, 2010)

Bidirectional Search in a String with Wavelet Trees. - Thomas Schnattinger; Enno Ohlebusch; Simon Gog (CPM, 2010)

Advantages of Shared Data Structures for Sequences of Balanced Parentheses. - Simon Gog; Johannes Fischer 001 (DCC, 2010)

CST++. - Enno Ohlebusch; Johannes Fischer 001; Simon Gog (SPIRE, 2010)

Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. - Enno Ohlebusch; Simon Gog; Adrian Kügel (SPIRE, 2010)

Lightweight LCP-Array Construction in Linear Time - Simon Gog; Enno Ohlebusch (CoRR, 2010)

Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem. - Enno Ohlebusch; Simon Gog (Inf. Process. Lett., 2010)

Fast and Lightweight LCP-Array Construction Algorithms. - Simon Gog; Enno Ohlebusch (ALENEX, 2011)

Lempel-Ziv Factorization Revisited. - Enno Ohlebusch; Simon Gog (CPM, 2011)

Compressed suffix trees: design, construction, and applications. - Simon Gog (2011)

Bidirectional search in a string with wavelet trees and bidirectional matching statistics. - Thomas Schnattinger; Enno Ohlebusch; Simon Gog (Inf. Comput., 2012)

Space-Efficient Construction of the Burrows-Wheeler Transform. - Timo Beller; Maike Zwerger; Simon Gog; Enno Ohlebusch (SPIRE, 2013)

Adding Compression and Blended Search to a Compact Two-Level Suffix Array. - Simon Gog; Alistair Moffat (SPIRE, 2013)

Computing the longest common prefix array based on the Burrows-Wheeler transform. - Timo Beller; Simon Gog; Enno Ohlebusch; Thomas Schnattinger (J. Discrete Algorithms, 2013)

Compressed suffix trees: Efficient computation and storage of LCP-values. - Simon Gog; Enno Ohlebusch (ACM J. Exp. Algorithmics, 2013)

Relative FM-Indexes. - Djamal Belazzougui; Travis Gagie; Simon Gog; Giovanni Manzini; Jouni Sirén (SPIRE, 2014)

Relative Lempel-Ziv with Constant-Time Random Access. - Héctor Ferrada; Travis Gagie; Simon Gog; Simon J. Puglisi (SPIRE, 2014)

Strategic Pattern Search in Factor-Compressed Text. - Simon Gog; Alistair Moffat; Matthias Petri (SPIRE, 2014)

From Theory to Practice: Plug and Play with Succinct Data Structures. - Simon Gog; Timo Beller; Alistair Moffat; Matthias Petri (SEA, 2014)

Improved and Extended Locating Functionality on Compressed Suffix Arrays. - Simon Gog; Gonzalo Navarro 001 (SEA, 2014)

Compact Indexes for Flexible Top-k Retrieval. - Simon Gog; Matthias Petri (CoRR, 2014)

Multi-pattern matching with bidirectional indexes. - Simon Gog; Kalle Karhu; Juha Kärkkäinen; Veli Mäkinen; Niko Välimäki (J. Discrete Algorithms, 2014)

Optimized succinct data structures for massive data. - Simon Gog; Matthias Petri (Softw. Pract. Exp., 2014)

Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays. - Simon Gog; Alistair Moffat; J. Shane Culpepper; Andrew Turpin; Anthony Wirth (IEEE Trans. Knowl. Data Eng., 2014)

Improved Single-Term Top-k Document Retrieval. - Simon Gog; Gonzalo Navarro 001 (ALENEX, 2015)

Compact Indexes for Flexible Top- k k Retrieval. - Simon Gog; Matthias Petri (CPM, 2015)

On Identifying Phrases Using Collection Statistics. - Simon Gog; Alistair Moffat; Matthias Petri (ECIR, 2015)

Improved and extended locating functionality on compressed suffix arrays. - Simon Gog; Gonzalo Navarro 001; Matthias Petri (J. Discrete Algorithms, 2015)

Faster, Minuter. - Simon Gog; Juha Kärkkäinen; Dominik Kempa; Matthias Petri; Simon J. Puglisi (DCC, 2016)

Induced Suffix Sorting for String Collections. - Felipe A. Louza; Simon Gog; Guilherme P. Telles (DCC, 2016)

Fast and Compact Hamming Distance Index. - Simon Gog; Rossano Venturini (SIGIR, 2016)

Succinct Data Structures in Information Retrieval: Theory and Practice. - Simon Gog; Rossano Venturini (SIGIR, 2016)

Parallel Computation for the All-Pairs Suffix-Prefix Problem. - Felipe A. Louza; Simon Gog; Leandro Zanotto; Guido Araujo; Guilherme P. Telles (SPIRE, 2016)

Practical Variable Length Gap Pattern Matching. - Johannes Bader 001; Simon Gog; Matthias Petri (SEA, 2016)

Scalable Construction of Text Indexes. - Timo Bingmann; Simon Gog; Florian Kurpicz (CoRR, 2016)

An improved algorithm for the all-pairs suffix-prefix problem. - William H. A. Tustumi; Simon Gog; Guilherme P. Telles; Felipe A. Louza (J. Discrete Algorithms, 2016)

CSA++: Fast Pattern Search for Large Alphabets. - Simon Gog; Alistair Moffat; Matthias Petri (ALENEX, 2017)

Elias-Fano meets Single-Term Top-k Document Retrieval. - Julian Labeit; Simon Gog (ALENEX, 2017)

Fast Construction of Compressed Web Graphs. - Jan Broß; Simon Gog; Matthias Hauck; Marcus Paradies (SPIRE, 2017)

Practical Range Minimum Queries Revisited. - Niklas Baumstark; Simon Gog; Tobias Heuer; Julian Labeit (SEA, 2017)

The Quantile Index - Succinct Self-Index for Top-k Document Retrieval. - Niklas Baumstark; Simon Gog; Tobias Heuer; Julian Labeit (SEA, 2017)

Optimal suffix sorting and LCP array construction for constant alphabets. - Felipe A. Louza; Simon Gog; Guilherme P. Telles (Inf. Process. Lett., 2017)

Practical Compact Indexes for Top-k Document Retrieval. - Simon Gog; Roberto Konow; Gonzalo Navarro 001 (ACM J. Exp. Algorithmics, 2017)

Inducing enhanced suffix arrays for string collections. - Felipe A. Louza; Simon Gog; Guilherme P. Telles (Theor. Comput. Sci., 2017)

Scalable Construction of Text Indexes with Thrill. - Timo Bingmann; Simon Gog; Florian Kurpicz (IEEE BigData, 2018)

A Grammar Compression Algorithm Based on Induced Suffix Sorting. - Daniel Saad Nogueira Nunes; Felipe A. Louza; Simon Gog; Mauricio Ayala-Rincón; Gonzalo Navarro 001 (DCC, 2018)

Computing Burrows-Wheeler Similarity Distributions for String Collections. - Felipe A. Louza; Guilherme P. Telles; Simon Gog; Liang Zhao 001 (SPIRE, 2018)

Fixed Block Compression Boosting in FM-Indexes: Theory and Practice. - Simon Gog; Juha Kärkkäinen; Dominik Kempa; Matthias Petri; Simon J. Puglisi (Algorithmica, 2019)

Algorithms to compute the Burrows-Wheeler Similarity Distribution. - Felipe A. Louza; Guilherme P. Telles; Simon Gog; Liang Zhao 001 (Theor. Comput. Sci., 2019)

Efficient and Effective Query Auto-Completion. - Simon Gog; Giulio Ermanno Pibiri; Rossano Venturini (SIGIR, 2020)

gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. - Felipe A. Louza; Guilherme P. Telles; Simon Gog; Nicola Prezza; Giovanna Rosone (Algorithms Mol. Biol., 2020)

Construction of Fundamental Data Structures for Strings - Felipe A. Louza; Simon Gog; Guilherme P. Telles (Springer, 2020)

Grammar Compression by Induced Suffix Sorting. - Daniel Saad Nogueira Nunes; Felipe A. Louza; Simon Gog; Mauricio Ayala-Rincón; Gonzalo Navarro 001 (ACM J. Exp. Algorithmics, 2022)