- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| j5 |      | Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger: Computing the longest common prefix array based on the Burrows-Wheeler transform. J. Discrete Algorithms 18: 22-31 (2013) |
| i2 | | Simon Gog, Alistair Moffat, J. Shane Culpepper, Andrew Turpin, Anthony Wirth: Large-Scale Pattern Search Using Reduced-Space On-Disk Suffix Arrays. CoRR abs/1303.6481 (2013) |
| 2012 | ||
| j4 | | Thomas Schnattinger, Enno Ohlebusch, Simon Gog: Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Inf. Comput. 213: 13-22 (2012) |
| c12 | | Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen, Niko Välimäki: Multi-pattern Matching with Bidirectional Indexes. COCOON 2012: 384-395 |
| 2011 | ||
| c11 | | Simon Gog, Enno Ohlebusch: Fast and Lightweight LCP-Array Construction Algorithms. ALENEX 2011: 25-34 |
| c10 | | |
| c9 | | Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger: Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. SPIRE 2011: 197-208 |
| 2010 | ||
| j3 | | 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): 123-128 (2010) |
| c8 |  | Enno Ohlebusch, Simon Gog: Space-efficient Genome Comparisons with Compressed Full-text Indexes. BICoB 2010: 19-24 |
| c7 | | Thomas Schnattinger, Enno Ohlebusch, Simon Gog: Bidirectional Search in a String with Wavelet Trees. CPM 2010: 40-50 |
| c6 | | Simon Gog, Johannes Fischer: Advantages of Shared Data Structures for Sequences of Balanced Parentheses. DCC 2010: 406-415 |
| c5 | | |
| c4 | | Enno Ohlebusch, Simon Gog, Adrian Kügel: Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. SPIRE 2010: 347-358 |
| i1 | | Simon Gog, Enno Ohlebusch: Lightweight LCP-Array Construction in Linear Time. CoRR abs/1012.4263 (2010) |
| 2009 | ||
| c3 | | Enno Ohlebusch, Simon Gog: A Compressed Enhanced Suffix Array Supporting Fast String Matching. SPIRE 2009: 51-62 |
| c2 | | Simon Gog: Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays. SEA 2009: 161-172 |
| 2008 | ||
| j2 | | Simon Gog, Martin Bader, Enno Ohlebusch: GENESIS: genome evolution scenarios. Bioinformatics 24(5): 711-712 (2008) |
| j1 | | 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 | ||
| c1 | | Simon Gog, Martin Bader: How to Achieve an Equivalent Simple Permutation in Linear Time. RECOMB-CG 2007: 58-68 |
Colors in the list of coauthors
Last update Wed May 22 20:09:00 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page