Enno Ohlebusch

Publication Activity (10 Years)

Years Active: 1991-2022
Publications (10 Years): 19

Top Venues

SPIRE

CoRR

J. Discrete Algorithms

Bioinform.

Bielefeld University, Germany (PHD)

Education History

Bielefeld University, Germany

PHD

Publications

Uwe Baier, Thomas Büchler, Enno Ohlebusch, Pascal Weber
Edge minimization in de Bruijn graphs. Inf. Comput. 285 (Part) (2022)
Jannik Olbrich, Enno Ohlebusch, Thomas Büchler
On the Optimisation of the GSACA Suffix Array Construction Algorithm. CoRR (2022)
Jannik Olbrich, Enno Ohlebusch, Thomas Büchler
On the Optimisation of the GSACA Suffix Array Construction Algorithm. SPIRE (2022)
Thomas Büchler, Caroline Räther, Pascal Weber, Enno Ohlebusch
Coordinate Systems for Pangenome Graphs based on the Level Function and Minimum Path Covers. BIOINFORMATICS (2021)
Uwe Baier, Thomas Büchler, Enno Ohlebusch, Pascal Weber
Edge Minimization in de Bruijn Graphs. DCC (2020)
Thomas Büchler, Enno Ohlebusch
An improved encoding of genetic variation in a Burrows-Wheeler transform. Bioinform. 36 (5) (2020)
Kadir Dede, Enno Ohlebusch
Dynamic construction of pan-genome subgraphs. Open Comput. Sci. 10 (1) (2020)
Uwe Baier, Thomas Büchler, Enno Ohlebusch, Pascal Weber
Edge minimization in de Bruijn graphs. CoRR (2019)
Enno Ohlebusch, Pascal Weber
On the Computation of Longest Previous Non-overlapping Factors. SPIRE (2019)
Enno Ohlebusch, Stefan Stauß, Uwe Baier
Trickier XBWT Tricks. SPIRE (2018)
Uwe Baier, Timo Beller, Enno Ohlebusch
Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies. ACM J. Exp. Algorithmics 22 (2017)
Markus Mauer, Timo Beller, Enno Ohlebusch
A Lempel-Ziv-style Compression Method for Repetitive Texts. Stringology (2017)
Timo Beller, Enno Ohlebusch
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. Algorithms Mol. Biol. 11 (2016)
Timo Beller, Enno Ohlebusch
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. CoRR (2016)
Uwe Baier, Timo Beller, Enno Ohlebusch
Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform. Bioinform. 32 (4) (2016)
Timo Beller, Enno Ohlebusch
Erratum to: A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. Algorithms Mol. Biol. 11 (2016)
Timo Beller, Enno Ohlebusch
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis. CPM (2015)
Uwe Baier, Timo Beller, Enno Ohlebusch
Parallel Construction of Succinct Representations of Suffix Tree Topologies. SPIRE (2015)
Enno Ohlebusch, Timo Beller
Alphabet-independent algorithms for finding context-sensitive repeats in linear time. J. Discrete Algorithms 34 (2015)
Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda
Computing the Burrows-Wheeler transform of a string and its reverse in parallel. J. Discrete Algorithms 25 (2014)
Enno Ohlebusch, Timo Beller
Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time. SPIRE (2014)
Simon Gog, Enno Ohlebusch
Compressed suffix trees: Efficient computation and storage of LCP-values. ACM J. Exp. Algorithmics 18 (2013)
Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger
Computing the longest common prefix array based on the Burrows-Wheeler transform. J. Discrete Algorithms 18 (2013)
Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch
Space-Efficient Construction of the Burrows-Wheeler Transform. SPIRE (2013)
Timo Beller, Katharina Berger, Enno Ohlebusch
Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences. SPIRE (2012)
Thomas Schnattinger, Enno Ohlebusch, Simon Gog
Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Inf. Comput. 213 (2012)
Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda
Computing the Burrows-Wheeler Transform of a String and Its Reverse. CPM (2012)
Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger
Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. SPIRE (2011)
Simon Gog, Enno Ohlebusch
Fast and Lightweight LCP-Array Construction Algorithms. ALENEX (2011)
Michael Arnold, Enno Ohlebusch
Linear Time Algorithms for Generalizations of the Longest Common Substring Problem. Algorithmica 60 (4) (2011)
Enno Ohlebusch, Simon Gog
Lempel-Ziv Factorization Revisited. CPM (2011)
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) (2010)
Thomas Schnattinger, Enno Ohlebusch, Simon Gog
Bidirectional Search in a String with Wavelet Trees. CPM (2010)
Enno Ohlebusch, Simon Gog, Adrian Kügel
Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. SPIRE (2010)
Enno Ohlebusch, Simon Gog
Space-efficient Genome Comparisons with Compressed Full-text Indexes. BICoB (2010)
Enno Ohlebusch, Johannes Fischer, Simon Gog
CST++. SPIRE (2010)
Simon Gog, Enno Ohlebusch
Lightweight LCP-Array Construction in Linear Time CoRR (2010)
Enno Ohlebusch, Simon Gog
A Compressed Enhanced Suffix Array Supporting Fast String Matching. SPIRE (2009)
Adrian Kügel, Enno Ohlebusch
A Space Efficient Solution to the Frequent String Mining Problem for Many Databases. ECML/PKDD (1) (2008)
Enno Ohlebusch, Stefan Kurtz
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences. J. Comput. Biol. 15 (4) (2008)
Adrian Kügel, Enno Ohlebusch
A space efficient solution to the frequent string mining problem for many databases. Data Min. Knowl. Discov. 17 (1) (2008)
Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions. BMC Bioinform. 9 (2008)
Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch
CoCoNUT: an efficient system for the comparison and analysis of genomes. BMC Bioinform. 9 (2008)
Simon Gog, Martin Bader, Enno Ohlebusch
GENESIS: genome evolution scenarios. Bioinform. 24 (5) (2008)
Enno Ohlebusch
Conditional Term Graph Rewriting with Indirect Sharing. Electron. Notes Theor. Comput. Sci. 72 (1) (2007)
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel
A linear time algorithm for the inversion median problem in circular bacterial genomes. J. Discrete Algorithms 5 (4) (2007)
Martin Bader, Enno Ohlebusch
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. J. Comput. Biol. 14 (5) (2007)
Martin Bader, Enno Ohlebusch
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. RECOMB (2006)
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
Chaining algorithms for multiple genome comparison. J. Discrete Algorithms 3 (2-4) (2005)
Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp
The Median Problem for the Reversal Distance in Circular Bacterial Genomes. CPM (2005)
Christian Wawra, Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
Efficient mapping of large cDNA/EST databases to genomes: A comparison of two different strategies. German Conference on Bioinformatics (2005)
Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch
Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2 (1) (2004)
Michael Beckstette, Jens T. Mailänder, Richard J. Marhöfer, Alexander Sczyrba, Enno Ohlebusch, Robert Giegerich, Paul M. Selzer
Genlight: Interactive high-throughput sequence analysis and comparative genomics. J. Integr. Bioinform. 1 (1) (2004)
Patrick Chain, Stefan Kurtz, Enno Ohlebusch, Tom Slezak
An Applications-focused Review of Comparative Genomics Tools: Capabilities, Limitations and Future Challenges. Briefings Bioinform. 4 (2) (2003)
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
A Local Chaining Algorithm and Its Applications in Comparative Genomics. WABI (2003)
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch
Multiple Genome Alignment: Chaining Algorithms Revisited. CPM (2003)
Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch
The Enhanced Suffix Array and Its Applications to Genome Analysis. WABI (2002)
Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz
Optimal Exact Strring Matching Based on Suffix Arrays. SPIRE (2002)
Enno Ohlebusch
Hierarchical termination revisited. Inf. Process. Lett. 84 (4) (2002)
Jürgen Giesl, Thomas Arts, Enno Ohlebusch
Modular Termination Proofs for Rewriting Using Dependency Pairs. J. Symb. Comput. 34 (1) (2002)
Michael Höhl, Stefan Kurtz, Enno Ohlebusch
Efficient multiple genome alignment. ISMB (2002)
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178 (1) (2002)
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178 (1) (2002)
Enno Ohlebusch
Implementing conditional term rewriting by graph rewriting. Theor. Comput. Sci. 262 (1) (2001)
Enno Ohlebusch
Termination of Logic Programs: Transformational Methods Revisited. Appl. Algebra Eng. Commun. Comput. 12 (1/2) (2001)
Enno Ohlebusch
A uniform framework for term and graph rewriting applied to combined systems. Inf. Process. Lett. 73 (1-2) (2000)
Enno Ohlebusch, Claus Claves, Claude Marché
TALP: A Tool for the Termination Analysis of Logic Programs. RTA (2000)
Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher, Jens Stoye, Robert Giegerich
Computation and Visualization of Degenerate Repeats in Complete Genomes. ISMB (2000)
Enno Ohlebusch
On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems. Fuji International Symposium on Functional and Logic Programming (1999)
Bernd Bütow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing
Semantic Matching for Left-Linear Convergent Rewrite Systems J. Funct. Log. Program. 1999 (11) (1999)
Enno Ohlebusch
Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems. LPAR (1999)
Enno Ohlebusch
Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof. Bull. EATCS 66 (1998)
Enno Ohlebusch
Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation. RTA (1998)
Jürgen Giesl, Enno Ohlebusch
Pushing the Frontiers of Combining Rewrite Systems Farther Outwards. FroCoS (1998)
Enno Ohlebusch
A Filter Method for the Weighted Local Similarity Search Problem. CPM (1997)
Enno Ohlebusch, Esko Ukkonen
On the Equivalence Problem for E-Pattern Languages. Theor. Comput. Sci. 186 (1-2) (1997)
Enno Ohlebusch
Conditional Term Graph Rewriting. ALP/HOA (1997)
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT (1997)
Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema
Relative Undecidability in Term Rewriting. CSL (1996)
Enno Ohlebusch, Esko Ukkonen
On the Equivalence Problem for E-Pattern Languages. MFCS (1996)
Enno Ohlebusch
Modular Properties of Composable Term Rewriting Systems. J. Symb. Comput. 20 (1) (1995)
Bernd Bütow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing
A New Strategy for Semantic Matching PLILP (1995)
Enno Ohlebusch
Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems. Inf. Process. Lett. 53 (4) (1995)
Enno Ohlebusch
On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems. CAAP (1994)
Enno Ohlebusch
Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems. CTRS (1994)
Enno Ohlebusch
On the Modularity of Termination of Term Rewriting Systems. Theor. Comput. Sci. 136 (2) (1994)
Enno Ohlebusch
A simple proof of sufficient conditions for the termination of the disjoint union of term rewriting systems. Bull. EATCS 50 (1993)
Enno Ohlebusch
Combinations of Simplifying Conditional Term Rewriting Systems. CTRS (1992)
Robert Giegerich, Enno Ohlebusch
An Implicit Representation of Infinite Sequences of Terms. Bull. EATCS 43 (1991)

Enno Ohlebusch.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Enno Ohlebusch