Enno Ohlebusch

100 papers A 3B 12C 15Misc 1Journal 48Unranked 17

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