Conference papers/Konferenzartikel

• 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
  Proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching, pages 40-50, LNCS 6129, 2010. © Springer-Verlag
  
  
• Enno Ohlebusch, Simon Gog, Adrian Kügel
  Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes
  Proceedings of the 17th International Symposium on String Processing and Information Retrieval, pages 347-358, LNCS 6393, 2010. © Springer-Verlag
  
  
• Enno Ohlebusch, Johannes Fischer, Simon Gog
  CST++
  Proceedings of the 17th International Symposium on String Processing and Information Retrieval, pages 322-333, LNCS 6393, 2010. © Springer-Verlag
  
  
• Enno Ohlebusch, Simon Gog
  A Compressed Enhanced Suffix Array Supporting Fast String Matching
  Proceedings of the 16th International Symposium on String Processing and Information Retrieval, pages 51-62, LNCS 5721, 2009. © Springer-Verlag  [Preprint]
  
  
• Martin Bader, Enno Ohlebusch
  Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
  Proceedings of the 10th Annual International Conference on Research in Computational Molecular Biology, pages 564-578, LNCS 3909, 2006.  © Springer-Verlag [Preprint]
  
  
• Christian Wawra, Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
  Efficient Mapping of Large cDNA/EST Databases to Genomes: A Comparison of two Different Strategies.  Proceedings of the German Conference on Bioinformatics, pages 29-43, LNI 73, GI, 2005. [Preprint]
  
  
• Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp
  The Median Problem for the Reversal Distance in Circular Bacterial Genomes
  Proceedings of the 16th Annual Symposium on Combinatorial Pattern Matching, pages 116-127, LNCS 3537, 2005. © Springer-Verlag   [Preprint]
  
  
• Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
  CHAINER: Software for Comparing Genomes
  Short paper at ISMB/ECCB 2004.  (12th International Conference on Intelligent Systems for Molecular Biology/3rd European Conference on Computational Biology)
  
  
• Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
  A Local Chaining Algorithm and its Applications in Comparative Genomics
  Proceedings of the 3rd Workshop on Algorithms in Bioinformatics, pages 1-16, LNBI 2812 , 2003. © Springer-Verlag
  
  
• Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
  Multiple Genome Alignment: Chaining Algorithms Revisited
  Proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, pages 1-16, LNCS 2676, 2003.  © Springer-Verlag
  
  
• Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz
  Optimal Exact String Matching Based on Suffix Arrays
  Proceedings of the 9th International Symposium on String Processing and Information Retrieval, pages 31-43, LNCS 2476, 2002. © Springer-Verlag
  
  
• Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch
  The Enhanced Suffix Array and its Applications to Genome Analysis
  Proceedings of the 2nd Workshop on Algorithms in Bioinformatics, pages 449-463, LNCS 2452, 2002. © Springer-Verlag
  
  
• Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher, Jens Stoye, Robert Giegerich
  Computation and Visualization of Degenerate Repeats in Complete Genomes
  Proceedings of the 8th International Conference on Intelligent Systems for Molecular Biology, pages 228-238, AAAI-Press, 2000.
  
  
• Enno Ohlebusch, Claus Claves, Claude Marche
  TALP: A Tool for the Termination Analysis of Logic Programs
  Proceedings of the 11th International Conference on Rewriting Techniques and Applications, pages 270-273, LNCS 1833, 2000.  © Springer-Verlag
  
  
• Jürgen Giesl, Enno Ohlebusch
  Pushing the Frontiers of Combining Rewrite Systems Farther Outwards
  Frontiers of Combining Systems 2 (Proceedings of FroCoS'98), pages 141-160, Research Studies Press Ltd., 2000.
  
  
• Enno Ohlebusch
  On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems
  Proceedings of the 4th International Symposium on Functional and Logic Programming, pages 179-193, LNCS 1722, 1999. © Springer-Verlag
  
  
• Enno Ohlebusch
  Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems
  Proceedings of the 6th International Conference on Logic for Programming and Automated Reasoning, pages 111-130, LNAI 1705, 1999. © Springer-Verlag
  
  
• Enno Ohlebusch
  Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation
  Proceedings of the 9th International Conference on Rewriting Techniques and Applications, pages 17-31, LNCS 1379, 1998.
  
  
• Enno Ohlebusch
  Conditional Term Graph Rewriting
  Proceedings of the 6th International Conference on Algebraic and Logic Programming, pages 144-158, LNCS 1298, 1997.
  
  
• Enno Ohlebusch
  A Filter Method for the Weighted Local Similarity Search Problem
  Proceedings of the 8th Annual Symposium on Combinatorial Pattern Matching, pages 191-205, LNCS 1264, 1997.
  
  
• Robert Giegerich, Frank Hischke, Stefan Kurtz, Enno Ohlebusch
  A General Technique to Improve Filter Algorithms for Approximate String Matching
  Proceedings of the 4th South American Workshop on String Processing, pages 38-52, Carlton University Press, 1997.
  
  
• Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
  Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules
  Proceedings of the 22nd Colloquium on Trees in Algebra and Programming, pages 237-248, LNCS 1214, 1997.
  
  
• Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
  Relative Undecidability in Term Rewriting
  Computer Science Logic, Proceedings of the 10th International Workshop, pages 150-166, LNCS 1258, 1997.
  
  
• Enno Ohlebusch, Esko Ukkonen
  On the Equivalence Problem for E-Pattern Languages (Extended Abstract)
  Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, pages 457-468, LNCS 1113, 1996.
  
  
• Bernd Bütow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing
  A New Calculus for Semantic Matching
  Programming Languages: Implementations, Logics and Programs, Proceedings of the 7th International Symposium, pages 81-96, LNCS 982, 1995.
  
  
• Enno Ohlebusch
  Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems.  Proceedings of the 4th International Workshop on Conditional Term Rewriting Systems, pages 296-315, LNCS 968, 1995.
  
  
• Enno Ohlebusch
  On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems
  Proceedings of the 19th Colloquium on Trees in Algebra and Programming, pages 261-275, LNCS 787, 1994.
  
  
• Enno Ohlebusch
  Combinations of Simplifying Conditional Term Rewriting Systems
  Proceedings of the 3rd International Workshop on Conditional Term Rewriting Systems, pages 113-127, LNCS 656, 1993.