Simon Gog

ORCID

Publication Activity (10 Years)

Years Active: 2007-2022
Publications (10 Years): 30

Top Venues

CoRR

SPIRE

SEA

J. Discrete Algorithms

University of Ulm (PHD)

Education History

University of Ulm

PHD

Publications

Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
Grammar Compression by Induced Suffix Sorting. ACM J. Exp. Algorithmics 27 (2022)
Simon Gog, Giulio Ermanno Pibiri, Rossano Venturini
Efficient and Effective Query Auto-Completion. SIGIR (2020)
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Nicola Prezza, Giovanna Rosone
gsufsort: constructing suffix arrays, LCP arrays and BWTs for string collections. Algorithms Mol. Biol. 15 (1) (2020)
Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
Grammar Compression By Induced Suffix Sorting. CoRR (2020)
Simon Gog, Giulio Ermanno Pibiri, Rossano Venturini
Efficient and Effective Query Auto-Completion. CoRR (2020)
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
Algorithms to compute the Burrows-Wheeler Similarity Distribution. CoRR (2019)
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
Algorithms to compute the Burrows-Wheeler Similarity Distribution. Theor. Comput. Sci. 782 (2019)
Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi
Fixed Block Compression Boosting in FM-Indexes: Theory and Practice. Algorithmica 81 (4) (2019)
Timo Bingmann, Simon Gog, Florian Kurpicz
Scalable Construction of Text Indexes with Thrill. IEEE BigData (2018)
Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
A Grammar Compression Algorithm Based on Induced Suffix Sorting. DCC (2018)
Felipe A. Louza, Guilherme P. Telles, Simon Gog, Liang Zhao
Computing Burrows-Wheeler Similarity Distributions for String Collections. SPIRE (2018)
Daniel Saad Nogueira Nunes, Felipe A. Louza, Simon Gog, Mauricio Ayala-Rincón, Gonzalo Navarro
A Grammar Compression Algorithm based on Induced Suffix Sorting. CoRR (2017)
Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit
The Quantile Index - Succinct Self-Index for Top-k Document Retrieval. SEA (2017)
Felipe A. Louza, Simon Gog, Guilherme P. Telles
Optimal suffix sorting and LCP array construction for constant alphabets. Inf. Process. Lett. 118 (2017)
Simon Gog, Alistair Moffat, Matthias Petri
CSA++: Fast Pattern Search for Large Alphabets. ALENEX (2017)
Jan Broß, Simon Gog, Matthias Hauck, Marcus Paradies
Fast Construction of Compressed Web Graphs. SPIRE (2017)
Niklas Baumstark, Simon Gog, Tobias Heuer, Julian Labeit
Practical Range Minimum Queries Revisited. SEA (2017)
Julian Labeit, Simon Gog
Document Retrieval. ALENEX (2017)
Simon Gog, Roberto Konow, Gonzalo Navarro
Document Retrieval. ACM J. Exp. Algorithmics 22 (2017)
Felipe A. Louza, Simon Gog, Guilherme P. Telles
Inducing enhanced suffix arrays for string collections. Theor. Comput. Sci. 678 (2017)
Johannes Bader, Simon Gog, Matthias Petri
Practical Variable Length Gap Pattern Matching. SEA (2016)
Timo Bingmann, Simon Gog, Florian Kurpicz
Scalable Construction of Text Indexes. CoRR (2016)
Simon Gog, Rossano Venturini
Fast and Compact Hamming Distance index. IIR (2016)
Felipe A. Louza, Simon Gog, Guilherme P. Telles
Induced Suffix Sorting for String Collections. DCC (2016)
Simon Gog, Rossano Venturini
Fast and Compact Hamming Distance Index. SIGIR (2016)
Simon Gog, Rossano Venturini
Succinct Data Structures in Information Retrieval: Theory and Practice. SIGIR (2016)
Felipe A. Louza, Simon Gog, Leandro Zanotto, Guido Araujo, Guilherme P. Telles
Parallel Computation for the All-Pairs Suffix-Prefix Problem. SPIRE (2016)
Simon Gog, Alistair Moffat, Matthias Petri
CSA++: Fast Pattern Search for Large Alphabets. CoRR (2016)
Simon Gog, Juha Kärkkäinen, Dominik Kempa, Matthias Petri, Simon J. Puglisi
Faster, Minuter. DCC (2016)
William H. A. Tustumi, Simon Gog, Guilherme P. Telles, Felipe A. Louza
An improved algorithm for the all-pairs suffix-prefix problem. J. Discrete Algorithms 37 (2016)
Simon Gog, Matthias Petri
Compact Indexes for Flexible Top- k k Retrieval. CPM (2015)
Simon Gog, Alistair Moffat, Matthias Petri
On Identifying Phrases Using Collection Statistics. ECIR (2015)
Simon Gog, Gonzalo Navarro
Document Retrieval. ALENEX (2015)
Simon Gog, Gonzalo Navarro, Matthias Petri
Improved and extended locating functionality on compressed suffix arrays. J. Discrete Algorithms 32 (2015)
Simon Gog, Matthias Petri
Optimized succinct data structures for massive data. Softw. Pract. Exp. 44 (11) (2014)
Simon Gog, Alistair Moffat, Matthias Petri
Strategic Pattern Search in Factor-Compressed Text. SPIRE (2014)
Simon Gog, Alistair Moffat, J. Shane Culpepper, Andrew Turpin, Anthony Wirth
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays. IEEE Trans. Knowl. Data Eng. 26 (8) (2014)
Simon Gog, Matthias Petri
Compact Indexes for Flexible Top-k Retrieval. CoRR (2014)
Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri
From Theory to Practice: Plug and Play with Succinct Data Structures. SEA (2014)
Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki
Multi-pattern matching with bidirectional indexes. J. Discrete Algorithms 24 (2014)
Héctor Ferrada, Travis Gagie, Simon Gog, Simon J. Puglisi
Relative Lempel-Ziv with Constant-Time Random Access. SPIRE (2014)
Simon Gog, Gonzalo Navarro
Improved and Extended Locating Functionality on Compressed Suffix Arrays. SEA (2014)
Djamal Belazzougui, Travis Gagie, Simon Gog, Giovanni Manzini, Jouni Sirén
Relative FM-Indexes. SPIRE (2014)
Simon Gog, Timo Beller, Alistair Moffat, Matthias Petri
From Theory to Practice: Plug and Play with Succinct Data Structures. CoRR (2013)
Simon Gog, Enno Ohlebusch
Compressed suffix trees: Efficient computation and storage of LCP-values. ACM J. Exp. Algorithmics 18 (2013)
Simon Gog, Alistair Moffat
Adding Compression and Blended Search to a Compact Two-Level Suffix Array. SPIRE (2013)
Simon Gog, Alistair Moffat, J. Shane Culpepper, Andrew Turpin, Anthony Wirth
Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays CoRR (2013)
Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger
Computing the longest common prefix array based on the Burrows-Wheeler transform. J. Discrete Algorithms 18 (2013)
Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch
Space-Efficient Construction of the Burrows-Wheeler Transform. SPIRE (2013)
Thomas Schnattinger, Enno Ohlebusch, Simon Gog
Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Inf. Comput. 213 (2012)
Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki
Multi-pattern Matching with Bidirectional Indexes. COCOON (2012)
Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger
Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. SPIRE (2011)
Simon Gog, Enno Ohlebusch
Fast and Lightweight LCP-Array Construction Algorithms. ALENEX (2011)
Enno Ohlebusch, Simon Gog
Lempel-Ziv Factorization Revisited. CPM (2011)
Simon Gog, Johannes Fischer
Advantages of Shared Data Structures for Sequences of Balanced Parentheses. DCC (2010)
Enno Ohlebusch, Simon Gog
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem. Inf. Process. Lett. 110 (3) (2010)
Thomas Schnattinger, Enno Ohlebusch, Simon Gog
Bidirectional Search in a String with Wavelet Trees. CPM (2010)
Enno Ohlebusch, Simon Gog, Adrian Kügel
Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. SPIRE (2010)
Enno Ohlebusch, Simon Gog
Space-efficient Genome Comparisons with Compressed Full-text Indexes. BICoB (2010)
Enno Ohlebusch, Johannes Fischer, Simon Gog
CST++. SPIRE (2010)
Simon Gog, Enno Ohlebusch
Lightweight LCP-Array Construction in Linear Time CoRR (2010)
Enno Ohlebusch, Simon Gog
A Compressed Enhanced Suffix Array Supporting Fast String Matching. SPIRE (2009)
Simon Gog
Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays. SEA (2009)
Simon Gog, Martin Bader
Fast Algorithms for Transforming Back and Forth between a Signed Permutation and Its Equivalent Simple Permutation. J. Comput. Biol. 15 (8) (2008)
Simon Gog, Martin Bader, Enno Ohlebusch
GENESIS: genome evolution scenarios. Bioinform. 24 (5) (2008)
Simon Gog, Martin Bader
How to Achieve an Equivalent Simple Permutation in Linear Time. RECOMB-CG (2007)

Simon Gog.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Simon Gog