| REPuter: the manifold applications of repeat analysis on a genomic scale S Kurtz, JV Choudhuri, E Ohlebusch, C Schleiermacher, J Stoye, ... Nucleic acids research 29 (22), 4633-4642, 2001 | 1050 | 2001 |
| Replacing suffix trees with enhanced suffix arrays MI Abouelhoda, S Kurtz, E Ohlebusch Journal of discrete algorithms 2 (1), 53-86, 2004 | 859 | 2004 |
| Advanced topics in term rewriting E Ohlebusch Springer Science & Business Media, 2002 | 327 | 2002 |
| Efficient multiple genome alignment M Höhl, S Kurtz, E Ohlebusch Bioinformatics 18 (suppl_1), S312-S320, 2002 | 236 | 2002 |
| The enhanced suffix array and its applications to genome analysis MI Abouelhoda, S Kurtz, E Ohlebusch International Workshop on Algorithms in Bioinformatics, 449-463, 2002 | 185 | 2002 |
| Optimal exact string matching based on suffix arrays MI Abouelhoda, E Ohlebusch, S Kurtz International Symposium on String Processing and Information Retrieval, 31-43, 2002 | 117 | 2002 |
| Modular termination proofs for rewriting using dependency pairs J Giesl, T Arts, E Ohlebusch Journal of symbolic computation 34 (1), 21-58, 2002 | 94 | 2002 |
| Modular properties of composable term rewriting systems E Ohlebusch J. Symb. Comput. 20 (1), 1-41, 1995 | 94 | 1995 |
| Modular Properties of Composable Term Rewriting Systems E Ohlebusch Dissertation, 1994 | 94 | 1994 |
| An applications-focused review of comparative genomics tools: Capabilities, limitations and future challenges P Chain, S Kurtz, E Ohlebusch, T Slezak Briefings in bioinformatics 4 (2), 105-123, 2003 | 93 | 2003 |
| Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction E Ohlebusch Oldenbusch Verlag, 2013 | 81* | 2013 |
| On the modularity of termination of term rewriting systems E Ohlebusch Theoretical Computer Science 136 (2), 333-360, 1994 | 76 | 1994 |
| Does coevolution promote species richness in parasitic cuckoos? O Krüger, MD Sorenson, NB Davies Proceedings of the Royal Society B: Biological Sciences 276 (1674), 3871-3879, 2009 | 75* | 2009 |
| Cst++ E Ohlebusch, J Fischer, S Gog International symposium on string processing and information retrieval, 322-333, 2010 | 71 | 2010 |
| Computation and visualization of degenerate repeats in complete genomes. S Kurtz, E Ohlebusch, C Schleiermacher, J Stoye, R Giegerich ISMB, 228-238, 2000 | 71 | 2000 |
| Sorting by weighted reversals, transpositions, and inverted transpositions M Bader, E Ohlebusch Journal of Computational Biology 14 (5), 615-636, 2007 | 68 | 2007 |
| Termination of logic programs: Transformational methods revisited E Ohlebusch Applicable Algebra in Engineering, Communication and Computing 12 (1-2), 73-116, 2001 | 62 | 2001 |
| Computing the longest common prefix array based on the Burrows–Wheeler transform T Beller, S Gog, E Ohlebusch, T Schnattinger Journal of Discrete Algorithms 18, 22-31, 2013 | 57 | 2013 |
| TALP: A tool for the termination analysis of logic programs E Ohlebusch, C Claves, C Marché International Conference on Rewriting Techniques and Applications, 270-273, 2000 | 48 | 2000 |
| Computing matching statistics and maximal exact matches on compressed full-text indexes E Ohlebusch, S Gog, A Kügel International Symposium on String Processing and Information Retrieval, 347-358, 2010 | 47 | 2010 |
