Enno Ohlebusch

According to our database, Enno Ohlebusch authored at least 85 papers between 1991 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

Efficient short read mapping to a pangenome that is represented by a graph of ED strings.

Thomas Büchler, Jannik Olbrich, Enno Ohlebusch

Bioinform., May, 2023

2022

Edge minimization in de Bruijn graphs.

Uwe Baier, Thomas Büchler, Enno Ohlebusch, Pascal Weber

Inf. Comput., 2022

On the Optimisation of the GSACA Suffix Array Construction Algorithm.

Jannik Olbrich, Enno Ohlebusch, Thomas Büchler

Proceedings of the String Processing and Information Retrieval, 2022

Scalable Text Index Construction.

Timo Bingmann, Patrick Dinklage, Johannes Fischer, Florian Kurpicz, Enno Ohlebusch, Peter Sanders

Proceedings of the Algorithms for Big Data - DFG Priority Program 1736, 2022

2021

Coordinate Systems for Pangenome Graphs based on the Level Function and Minimum Path Covers.

Thomas Büchler, Caroline Räther, Pascal Weber, Enno Ohlebusch

Proceedings of the 14th International Joint Conference on Biomedical Engineering Systems and Technologies, 2021

2020

Dynamic construction of pan-genome subgraphs.

Kadir Dede, Enno Ohlebusch

Open Comput. Sci., 2020

An improved encoding of genetic variation in a Burrows-Wheeler transform.

Thomas Büchler, Enno Ohlebusch

Bioinform., 2020

2019

On the Computation of Longest Previous Non-overlapping Factors.

Enno Ohlebusch, Pascal Weber

Proceedings of the String Processing and Information Retrieval, 2019

2018

Trickier XBWT Tricks.

Enno Ohlebusch, Stefan Stauß, Uwe Baier

Proceedings of the String Processing and Information Retrieval, 2018

2017

Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies.

Uwe Baier, Timo Beller, Enno Ohlebusch

ACM J. Exp. Algorithmics, 2017

A Lempel-Ziv-style Compression Method for Repetitive Texts.

Markus Mauer, Timo Beller, Enno Ohlebusch

Proceedings of the Prague Stringology Conference 2017, 2017

2016

Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform.

Uwe Baier, Timo Beller, Enno Ohlebusch

Bioinform., 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

A representation of a compressed de Bruijn graph for pan-genome analysis that enables search.

Timo Beller, Enno Ohlebusch

Algorithms Mol. Biol., 2016

2015

Alphabet-independent algorithms for finding context-sensitive repeats in linear time.

Enno Ohlebusch, Timo Beller

J. Discrete Algorithms, 2015

Parallel Construction of Succinct Representations of Suffix Tree Topologies.

Uwe Baier, Timo Beller, Enno Ohlebusch

Proceedings of the String Processing and Information Retrieval, 2015

Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis.

Timo Beller, Enno Ohlebusch

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2014

Computing the Burrows-Wheeler transform of a string and its reverse in parallel.

Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda

J. Discrete Algorithms, 2014

2013

Compressed suffix trees: Efficient computation and storage of LCP-values.

Simon Gog, Enno Ohlebusch

ACM J. Exp. Algorithmics, 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

Space-Efficient Construction of the Burrows-Wheeler Transform.

Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch

Proceedings of the String Processing and Information Retrieval, 2013

Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction

Enno Ohlebusch

Oldenbusch Verlag, ISBN: 978-3000413162, 2013

2012

Bidirectional search in a string with wavelet trees and bidirectional matching statistics.

Thomas Schnattinger, Enno Ohlebusch, Simon Gog

Inf. Comput., 2012

Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences.

Timo Beller, Katharina Berger, Enno Ohlebusch

Proceedings of the String Processing and Information Retrieval, 2012

Computing the Burrows-Wheeler Transform of a String and Its Reverse.

Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda

Proceedings of the Combinatorial Pattern Matching - 23rd Annual Symposium, 2012

2011

Linear Time Algorithms for Generalizations of the Longest Common Substring Problem.

Michael Arnold, Enno Ohlebusch

Algorithmica, 2011

Lempel-Ziv Factorization Revisited.

Enno Ohlebusch, Simon Gog

Proceedings of the Combinatorial Pattern Matching - 22nd Annual Symposium, 2011

Fast and Lightweight LCP-Array Construction Algorithms.

Simon Gog, Enno Ohlebusch

Proceedings of the Thirteenth Workshop on Algorithm Engineering and Experiments, 2011

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

Lightweight LCP-Array Construction in Linear Time

Simon Gog, Enno Ohlebusch

CoRR, 2010

Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes.

Enno Ohlebusch, Simon Gog, Adrian Kügel

Proceedings of the String Processing and Information Retrieval, 2010

CST++.

Enno Ohlebusch, Johannes Fischer, Simon Gog

Proceedings of the String Processing and Information Retrieval, 2010

Bidirectional Search in a String with Wavelet Trees.

Thomas Schnattinger, Enno Ohlebusch, Simon Gog

Proceedings of the Combinatorial Pattern Matching, 21st Annual Symposium, 2010

Space-efficient Genome Comparisons with Compressed Full-text Indexes.

Enno Ohlebusch, Simon Gog

Proceedings of the ISCA 2nd International Conference on Bioinformatics and Computational Biology, 2010

2009

A Compressed Enhanced Suffix Array Supporting Fast String Matching.

Enno Ohlebusch, Simon Gog

Proceedings of the String Processing and Information Retrieval, 2009

2008

Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences.

Enno Ohlebusch, Stefan Kurtz

J. Comput. Biol., 2008

A space efficient solution to the frequent string mining problem for many databases.

Adrian Kügel, Enno Ohlebusch

Data Min. Knowl. Discov., 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

CoCoNUT: an efficient system for the comparison and analysis of genomes.

Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch

BMC Bioinform., 2008

GENESIS: genome evolution scenarios.

Simon Gog, Martin Bader, Enno Ohlebusch

Bioinform., 2008

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

Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions.

Martin Bader, Enno Ohlebusch

J. Comput. Biol., 2007

2005

Chaining algorithms for multiple genome comparison.

Mohamed Ibrahim Abouelhoda, Enno Ohlebusch

J. Discrete Algorithms, 2005

Efficient mapping of large cDNA/EST databases to genomes: A comparison of two different strategies.

Christian Wawra, Mohamed Ibrahim Abouelhoda, Enno Ohlebusch

Proceedings of the German Conference on Bioinformatics (GCB 2005), Hamburg, 2005

The Median Problem for the Reversal Distance in Circular Bacterial Genomes.

Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp

Proceedings of the Combinatorial Pattern Matching, 16th Annual Symposium, 2005

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

Replacing suffix trees with enhanced suffix arrays.

Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch

J. Discrete Algorithms, 2004

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

A Local Chaining Algorithm and Its Applications in Comparative Genomics.

Mohamed Ibrahim Abouelhoda, Enno Ohlebusch

Proceedings of the Algorithms in Bioinformatics, Third International Workshop, 2003

Multiple Genome Alignment: Chaining Algorithms Revisited.

Mohamed Ibrahim Abouelhoda, Enno Ohlebusch

Proceedings of the Combinatorial Pattern Matching, 14th Annual Symposium, 2003

2002

Modular Termination Proofs for Rewriting Using Dependency Pairs.

Jürgen Giesl, Thomas Arts, Enno Ohlebusch

J. Symb. Comput., 2002

Hierarchical termination revisited.

Enno Ohlebusch

Inf. Process. Lett., 2002

Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy.

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema

Inf. Comput., 2002

Relative Undecidability in Term Rewriting: I. The Termination Hierarchy.

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema

Inf. Comput., 2002

Conditional Term Graph Rewriting with Indirect Sharing.

Enno Ohlebusch

Proceedings of the First International Workshop on Term Graph Rewriting, 2002

The Enhanced Suffix Array and Its Applications to Genome Analysis.

Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch

Proceedings of the Algorithms in Bioinformatics, Second International Workshop, 2002

Optimal Exact Strring Matching Based on Suffix Arrays.

Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz

Proceedings of the String Processing and Information Retrieval, 2002

Efficient multiple genome alignment.

Michael Höhl, Stefan Kurtz, Enno Ohlebusch

Proceedings of the Tenth International Conference on Intelligent Systems for Molecular Biology, 2002

Advanced topics in term rewriting.

Enno Ohlebusch

Springer, ISBN: 978-0-387-95250-5, 2002

2001

Implementing conditional term rewriting by graph rewriting.

Enno Ohlebusch

Theor. Comput. Sci., 2001

Termination of Logic Programs: Transformational Methods Revisited.

Enno Ohlebusch

Appl. Algebra Eng. Commun. Comput., 2001

2000

A uniform framework for term and graph rewriting applied to combined systems.

Enno Ohlebusch

Inf. Process. Lett., 2000

TALP: A Tool for the Termination Analysis of Logic Programs.

Enno Ohlebusch, Claus Claves, Claude Marché

Proceedings of the Rewriting Techniques and Applications, 11th International Conference, 2000

Computation and Visualization of Degenerate Repeats in Complete Genomes.

Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher, Jens Stoye, Robert Giegerich

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, 2000

1999

Semantic Matching for Left-Linear Convergent Rewrite Systems

Bernd Bütow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing

J. Funct. Log. Program., 1999

Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems.

Enno Ohlebusch

Proceedings of the Logic Programming and Automated Reasoning, 6th International Conference, 1999

On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems.

Enno Ohlebusch

Proceedings of the Functional and Logic Programming, 4th Fuji International Symposium, 1999

1998

Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof.

Enno Ohlebusch

Bull. EATCS, 1998

Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation.

Enno Ohlebusch

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

Pushing the Frontiers of Combining Rewrite Systems Farther Outwards.

Jürgen Giesl, Enno Ohlebusch

Proceedings of the Frontiers of Combining Systems, Second International Workshop, 1998

1997

On the Equivalence Problem for E-Pattern Languages.

Enno Ohlebusch, Esko Ukkonen

Theor. Comput. Sci., 1997

Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules.

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema

Proceedings of the TAPSOFT'97: Theory and Practice of Software Development, 1997

A Filter Method for the Weighted Local Similarity Search Problem.

Enno Ohlebusch

Proceedings of the Combinatorial Pattern Matching, 8th Annual Symposium, 1997

Conditional Term Graph Rewriting.

Enno Ohlebusch

Proceedings of the Algebraic and Logic Programming, 6th International Joint Conference, 1997

1996

Relative Undecidability in Term Rewriting.

Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema

Proceedings of the Computer Science Logic, 10th International Workshop, 1996

1995

Modular Properties of Composable Term Rewriting Systems.

Enno Ohlebusch

J. Symb. Comput., 1995

Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems.

Enno Ohlebusch

Inf. Process. Lett., 1995

A New Strategy for Semantic Matching

Bernd Bütow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing

Proceedings of the Programming Languages: Implementations, 1995

1994

Modular properties of composable term rewriting systems.

Enno Ohlebusch

PhD thesis, 1994

On the Modularity of Termination of Term Rewriting Systems.

Enno Ohlebusch

Theor. Comput. Sci., 1994

Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems.

Enno Ohlebusch

Proceedings of the Conditional and Typed Rewriting Systems, 4th International Workshop, 1994

On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems.

Enno Ohlebusch

Proceedings of the Trees in Algebra and Programming, 1994

1993

A simple proof of sufficient conditions for the termination of the disjoint union of term rewriting systems.

Enno Ohlebusch

Bull. EATCS, 1993

1992

Combinations of Simplifying Conditional Term Rewriting Systems.

Enno Ohlebusch

Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

1991

An Implicit Representation of Infinite Sequences of Terms.

Robert Giegerich, Enno Ohlebusch

Bull. EATCS, 1991