| |
| * | 2009 | |
|---|---|---|
| 5 | EE | Simon Gog: Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays. SEA 2009: 161-172 |
| 4 | EE | Enno Ohlebusch, Simon Gog: A Compressed Enhanced Suffix Array Supporting Fast String Matching. SPIRE 2009: 51-62 |
| 2008 | ||
| 3 | EE | Simon Gog, Martin Bader, Enno Ohlebusch: GENESIS: genome evolution scenarios. Bioinformatics 24(5): 711-712 (2008) |
| 2 | EE | Simon Gog, Martin Bader: Fast Algorithms for Transforming Back and Forth between a Signed Permutation and Its Equivalent Simple Permutation. Journal of Computational Biology 15(8): 1029-1041 (2008) |
| 2007 | ||
| 1 | EE | Simon Gog, Martin Bader: How to Achieve an Equivalent Simple Permutation in Linear Time. RECOMB-CG 2007: 58-68 |
| 1 | Martin Bader | [1] [2] [3] |
| 2 | Enno Ohlebusch | [3] [4] |