An Implicit Representation of Infinite Sequences of Terms. - Robert Giegerich; Enno Ohlebusch (Bull. EATCS, 1991)

Combinations of Simplifying Conditional Term Rewriting Systems. - Enno Ohlebusch (CTRS, 1992)

A simple proof of sufficient conditions for the termination of the disjoint union of term rewriting systems. - Enno Ohlebusch (Bull. EATCS, 1993)

On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems. - Enno Ohlebusch (CAAP, 1994)

Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems. - Enno Ohlebusch (CTRS, 1994)

On the Modularity of Termination of Term Rewriting Systems. - Enno Ohlebusch (Theor. Comput. Sci., 1994)

Modular properties of composable term rewriting systems. - Enno Ohlebusch (1994)

A New Strategy for Semantic Matching - Bernd Bütow; Robert Giegerich; Enno Ohlebusch; Stephan Thesing (PLILP, 1995)

Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems. - Enno Ohlebusch (Inf. Process. Lett., 1995)

Modular Properties of Composable Term Rewriting Systems. - Enno Ohlebusch (J. Symb. Comput., 1995)

Relative Undecidability in Term Rewriting. - Alfons Geser; Aart Middeldorp; Enno Ohlebusch; Hans Zantema (CSL, 1996)

Conditional Term Graph Rewriting. - Enno Ohlebusch (ALP/HOA, 1997)

A Filter Method for the Weighted Local Similarity Search Problem. - Enno Ohlebusch (CPM, 1997)

Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. - Alfons Geser; Aart Middeldorp; Enno Ohlebusch; Hans Zantema (TAPSOFT, 1997)

On the Equivalence Problem for E-Pattern Languages. - Enno Ohlebusch; Esko Ukkonen (Theor. Comput. Sci., 1997)

Pushing the Frontiers of Combining Rewrite Systems Farther Outwards. - Jürgen Giesl; Enno Ohlebusch (FroCoS, 1998)

Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation. - Enno Ohlebusch (RTA, 1998)

Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof. - Enno Ohlebusch (Bull. EATCS, 1998)

On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems. - Enno Ohlebusch (Fuji International Symposium on Functional and Logic Programming, 1999)

Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems. - Enno Ohlebusch (LPAR, 1999)

Semantic Matching for Left-Linear Convergent Rewrite Systems - Bernd Bütow; Robert Giegerich; Enno Ohlebusch; Stephan Thesing (J. Funct. Log. Program., 1999)

Computation and Visualization of Degenerate Repeats in Complete Genomes. - Stefan Kurtz; Enno Ohlebusch; Chris Schleiermacher; Jens Stoye; Robert Giegerich (ISMB, 2000)

TALP: A Tool for the Termination Analysis of Logic Programs. - Enno Ohlebusch; Claus Claves; Claude Marché (RTA, 2000)

A uniform framework for term and graph rewriting applied to combined systems. - Enno Ohlebusch (Inf. Process. Lett., 2000)

Termination of Logic Programs: Transformational Methods Revisited. - Enno Ohlebusch (Appl. Algebra Eng. Commun. Comput., 2001)

Implementing conditional term rewriting by graph rewriting. - Enno Ohlebusch (Theor. Comput. Sci., 2001)

Advanced topics in term rewriting. - Enno Ohlebusch (Springer, 2002)

Efficient multiple genome alignment. - Michael Höhl; Stefan Kurtz; Enno Ohlebusch (ISMB, 2002)

Optimal Exact Strring Matching Based on Suffix Arrays. - Mohamed Ibrahim Abouelhoda; Enno Ohlebusch; Stefan Kurtz (SPIRE, 2002)

The Enhanced Suffix Array and Its Applications to Genome Analysis. - Mohamed Ibrahim Abouelhoda; Stefan Kurtz; Enno Ohlebusch (WABI, 2002)

Conditional Term Graph Rewriting with Indirect Sharing. - Enno Ohlebusch (TERMGRAPH, 2002)

Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. - Alfons Geser; Aart Middeldorp; Enno Ohlebusch; Hans Zantema (Inf. Comput., 2002)

Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. - Alfons Geser; Aart Middeldorp; Enno Ohlebusch; Hans Zantema (Inf. Comput., 2002)

Hierarchical termination revisited. - Enno Ohlebusch (Inf. Process. Lett., 2002)

Modular Termination Proofs for Rewriting Using Dependency Pairs. - Jürgen Giesl; Thomas Arts; Enno Ohlebusch (J. Symb. Comput., 2002)

Multiple Genome Alignment: Chaining Algorithms Revisited. - Mohamed Ibrahim Abouelhoda; Enno Ohlebusch (CPM, 2003)

A Local Chaining Algorithm and Its Applications in Comparative Genomics. - Mohamed Ibrahim Abouelhoda; Enno Ohlebusch (WABI, 2003)

An Applications-focused Review of Comparative Genomics Tools: Capabilities, Limitations and Future Challenges. - Patrick S. G. Chain; Stefan Kurtz; Enno Ohlebusch; Tom Slezak (Briefings Bioinform., 2003)

Replacing suffix trees with enhanced suffix arrays. - Mohamed Ibrahim Abouelhoda; Stefan Kurtz; Enno Ohlebusch (J. Discrete Algorithms, 2004)

Genlight: Interactive high-throughput sequence analysis and comparative genomics. - Michael Beckstette; Jens T. Mailänder; Richard J. Marhöfer; Alexander Sczyrba; Enno Ohlebusch; Robert Giegerich; Paul M. Selzer (J. Integr. Bioinform., 2004)

The Median Problem for the Reversal Distance in Circular Bacterial Genomes. - Enno Ohlebusch; Mohamed Ibrahim Abouelhoda; Kathrin Hockel; Jan Stallkamp (CPM, 2005)

Efficient mapping of large cDNA/EST databases to genomes: A comparison of two different strategies. - Christian Wawra; Mohamed Ibrahim Abouelhoda; Enno Ohlebusch (German Conference on Bioinformatics, 2005)

Chaining algorithms for multiple genome comparison. - Mohamed Ibrahim Abouelhoda; Enno Ohlebusch (J. Discrete Algorithms, 2005)

Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. - Martin Bader; Enno Ohlebusch (J. Comput. Biol., 2007)

A linear time algorithm for the inversion median problem in circular bacterial genomes. - Enno Ohlebusch; Mohamed Ibrahim Abouelhoda; Kathrin Hockel (J. Discrete Algorithms, 2007)

GENESIS: genome evolution scenarios. - Simon Gog; Martin Bader; Enno Ohlebusch (Bioinform., 2008)

CoCoNUT: an efficient system for the comparison and analysis of genomes. - Mohamed Ibrahim Abouelhoda; Stefan Kurtz; Enno Ohlebusch (BMC Bioinform., 2008)

A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions. - Martin Bader; Mohamed Ibrahim Abouelhoda; Enno Ohlebusch (BMC Bioinform., 2008)

A space efficient solution to the frequent string mining problem for many databases. - Adrian Kügel; Enno Ohlebusch (Data Min. Knowl. Discov., 2008)

Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences. - Enno Ohlebusch; Stefan Kurtz (J. Comput. Biol., 2008)

A Compressed Enhanced Suffix Array Supporting Fast String Matching. - Enno Ohlebusch; Simon Gog (SPIRE, 2009)

Space-efficient Genome Comparisons with Compressed Full-text Indexes. - Enno Ohlebusch; Simon Gog (BICoB, 2010)

Bidirectional Search in a String with Wavelet Trees. - Thomas Schnattinger; Enno Ohlebusch; Simon Gog (CPM, 2010)

CST++. - Enno Ohlebusch; Johannes Fischer 001; Simon Gog (SPIRE, 2010)

Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. - Enno Ohlebusch; Simon Gog; Adrian Kügel (SPIRE, 2010)

Lightweight LCP-Array Construction in Linear Time - Simon Gog; Enno Ohlebusch (CoRR, 2010)

Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem. - Enno Ohlebusch; Simon Gog (Inf. Process. Lett., 2010)

Fast and Lightweight LCP-Array Construction Algorithms. - Simon Gog; Enno Ohlebusch (ALENEX, 2011)

Lempel-Ziv Factorization Revisited. - Enno Ohlebusch; Simon Gog (CPM, 2011)

Linear Time Algorithms for Generalizations of the Longest Common Substring Problem. - Michael Arnold; Enno Ohlebusch (Algorithmica, 2011)

Computing the Burrows-Wheeler Transform of a String and Its Reverse. - Enno Ohlebusch; Timo Beller; Mohamed Ibrahim Abouelhoda (CPM, 2012)

Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences. - Timo Beller; Katharina Berger; Enno Ohlebusch (SPIRE, 2012)

Bidirectional search in a string with wavelet trees and bidirectional matching statistics. - Thomas Schnattinger; Enno Ohlebusch; Simon Gog (Inf. Comput., 2012)

Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction - Enno Ohlebusch (Oldenbusch Verlag, 2013)

Space-Efficient Construction of the Burrows-Wheeler Transform. - Timo Beller; Maike Zwerger; Simon Gog; Enno Ohlebusch (SPIRE, 2013)

Computing the longest common prefix array based on the Burrows-Wheeler transform. - Timo Beller; Simon Gog; Enno Ohlebusch; Thomas Schnattinger (J. Discrete Algorithms, 2013)

Compressed suffix trees: Efficient computation and storage of LCP-values. - Simon Gog; Enno Ohlebusch (ACM J. Exp. Algorithmics, 2013)

Computing the Burrows-Wheeler transform of a string and its reverse in parallel. - Enno Ohlebusch; Timo Beller; Mohamed Ibrahim Abouelhoda (J. Discrete Algorithms, 2014)

Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis. - Timo Beller; Enno Ohlebusch (CPM, 2015)

Parallel Construction of Succinct Representations of Suffix Tree Topologies. - Uwe Baier; Timo Beller; Enno Ohlebusch (SPIRE, 2015)

Alphabet-independent algorithms for finding context-sensitive repeats in linear time. - Enno Ohlebusch; Timo Beller (J. Discrete Algorithms, 2015)

A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. - Timo Beller; Enno Ohlebusch (Algorithms Mol. Biol., 2016)

Erratum to: A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. - Timo Beller; Enno Ohlebusch (Algorithms Mol. Biol., 2016)

Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform. - Uwe Baier; Timo Beller; Enno Ohlebusch (Bioinform., 2016)

A Lempel-Ziv-style Compression Method for Repetitive Texts. - Markus Mauer; Timo Beller; Enno Ohlebusch (Stringology, 2017)

Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies. - Uwe Baier; Timo Beller; Enno Ohlebusch (ACM J. Exp. Algorithmics, 2017)

Trickier XBWT Tricks. - Enno Ohlebusch; Stefan Stauß; Uwe Baier (SPIRE, 2018)

On the Computation of Longest Previous Non-overlapping Factors. - Enno Ohlebusch; Pascal Weber 001 (SPIRE, 2019)

An improved encoding of genetic variation in a Burrows-Wheeler transform. - Thomas Büchler; Enno Ohlebusch (Bioinform., 2020)

Dynamic construction of pan-genome subgraphs. - Kadir Dede; Enno Ohlebusch (Open Comput. Sci., 2020)

Coordinate Systems for Pangenome Graphs based on the Level Function and Minimum Path Covers. - Thomas Büchler; Caroline Räther; Pascal Weber 001; Enno Ohlebusch (BIOINFORMATICS, 2021)

Scalable Text Index Construction. - Timo Bingmann; Patrick Dinklage; Johannes Fischer 001; Florian Kurpicz; Enno Ohlebusch; Peter Sanders 001 (Algorithms for Big Data, 2022)

On the Optimisation of the GSACA Suffix Array Construction Algorithm. - Jannik Olbrich; Enno Ohlebusch; Thomas Büchler (SPIRE, 2022)

Edge minimization in de Bruijn graphs. - Uwe Baier; Thomas Büchler; Enno Ohlebusch; Pascal Weber 001 (Inf. Comput., 2022)

Efficient short read mapping to a pangenome that is represented by a graph of ED strings. - Thomas Büchler; Jannik Olbrich; Enno Ohlebusch (Bioinform., 2023)

Faster Computation of Chinese Frequent Strings and Their Net Frequencies. - Enno Ohlebusch; Thomas Büchler; Jannik Olbrich (SPIRE, 2024)

Generic Non-recursive Suffix Array Construction. - Jannik Olbrich; Enno Ohlebusch; Thomas Büchler (ACM Trans. Algorithms, 2024)

Generating Multiple Alignments of Genomes of the Same Species. - Jannik Olbrich; Thomas Büchler; Enno Ohlebusch (BIOSTEC (1), 2025)

A Taxonomy of LCP-Array Construction Algorithms. - Johannes Fischer 001; Enno Ohlebusch (The Expanding World of Compressed Data, 2025)