Dr. Simon Gog


  • Enno Ohlebusch, Simon Gog
    Lempel-Ziv Factorization Revisited, CPM 2011, Slides
  • Simon Gog, Enno Ohlebusch
    Fast and Lightweight LCP-Array Construction Algorithms, ALENEX 2011
  • 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, Slides
  • Enno Ohlebusch, Johannes Fischer, Simon Gog
    CST++, SPIRE 2010
  • Enno Ohlebusch, Simon Gog
    Space-efficient genome comparisons with compressed full-text indexes, BiCoB 2010, Slides
  • Simon Gog, Johannes Fischer
    Advantages of Shared Data Structures for Sequences of Balanced Parentheses.
    Proceedings of the 2010 Data Compression Conference, Slides
  • Enno Ohlebusch, Simon Gog
    Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
    Information Proceeding Letters, 2009.
  • Enno Ohlebusch, Simon Gog
    A Compressed Enhanced Suffix Array Supporting Fast String Matching
    Proceedings of SPIRE 2009, Slides
  • Simon Gog
    Broadword Computing and Fibonacci Code speed up Compressed Suffix Arrays
    Proceedings of SEA 2009, Slides
  • Simon Gog, Martin Bader
    Fast algorithms for transforming back and forth between a signed permutation and its equivalent simple permutation
    Journal of Computational Biology 2008, 15(8), pages 1-13
    © Mary Ann Liebert, Inc.   Preprint
  • Simon Gog, Martin Bader, Enno Ohlebusch
    GENESIS: genome evolution scenarios
    Bioinformatics. 2008, 24(5), pages 711-712
    © Oxford Journals   Preprint
  • Simon Gog, Martin Bader
    How to achieve an equivalent simple permutation in linear time
    Proceedings of the 5th Annual RECOMB Satellite Workshop on Comparative Genomics, LNCS, 2007.
    © Springer-Verlag Preprint
  • "Effiziente Algorithmen zur Rekonstruktion der Evolution von Genomen"
    Diploma thesis, Ulm University (July 2006)


  • Succinct Data Structures
  • String Processing Algorithms
  • Comparative Genomics
  • Cryptography
  • Programming contests (ACM ICPC, informatiCup)