Simon Gog

	2012
16		Thomas Schnattinger, Enno Ohlebusch, Simon Gog: Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Inf. Comput. 213: 13-22 (2012)
	2011
15		Simon Gog, Enno Ohlebusch: Fast and Lightweight LCP-Array Construction Algorithms. ALENEX 2011: 25-34
14		Enno Ohlebusch, Simon Gog: Lempel-Ziv Factorization Revisited. CPM 2011: 15-26
13		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
12		Enno Ohlebusch, Simon Gog: Space-efficient Genome Comparisons with Compressed Full-text Indexes. BICoB 2010: 19-24
11		Thomas Schnattinger, Enno Ohlebusch, Simon Gog: Bidirectional Search in a String with Wavelet Trees. CPM 2010: 40-50
10		Simon Gog, Johannes Fischer: Advantages of Shared Data Structures for Sequences of Balanced Parentheses. DCC 2010: 406-415
9		Enno Ohlebusch, Johannes Fischer, Simon Gog: CST++. SPIRE 2010: 322-333
8		Enno Ohlebusch, Simon Gog, Adrian Kügel: Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. SPIRE 2010: 347-358
7		Simon Gog, Enno Ohlebusch: Lightweight LCP-Array Construction in Linear Time CoRR abs/1012.4263: (2010)
6		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)
	2009
5		Simon Gog: Broadword Computing and Fibonacci Code Speed Up Compressed Suffix Arrays. SEA 2009: 161-172
4		Enno Ohlebusch, Simon Gog: A Compressed Enhanced Suffix Array Supporting Fast String Matching. SPIRE 2009: 51-62
	2008
3		Simon Gog, Martin Bader, Enno Ohlebusch: GENESIS: genome evolution scenarios. Bioinformatics 24(5): 711-712 (2008)
2		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		Simon Gog, Martin Bader: How to Achieve an Equivalent Simple Permutation in Linear Time. RECOMB-CG 2007: 58-68

Coauthor Index

1	Martin Bader	[1] [2] [3]
2	Timo Beller	[13]
3	Johannes Fischer	[9] [10]
4	Adrian Kügel	[8]
5	Enno Ohlebusch	[3] [4] [6] [7] [8] [9] [11] [12] [13] [14] [15] [16]
6	Thomas Schnattinger	[11] [13] [16]

Last update Wed May 30 22:34:44 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page