Enno Ohlebusch

From MaRDI portal
Person:199245

Available identifiers

zbMath Open ohlebusch.ennoMaRDI QIDQ199245

List of research outcomes





PublicationDate of PublicationType
On the computation of longest previous non-overlapping factors2024-04-19Paper
On the optimisation of the GSACA suffix array construction algorithm2023-08-04Paper
Trickier XBWT tricks2023-07-28Paper
Combinations of simplifying conditional term rewriting systems2023-03-09Paper
Edge minimization in de Bruijn graphs2022-06-08Paper
Fast and Lightweight LCP-Array Construction Algorithms2019-09-12Paper
Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies2017-07-03Paper
Alphabet-independent algorithms for finding context-sensitive repeats in linear time2015-08-24Paper
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis2015-08-20Paper
Compressed suffix trees2015-03-16Paper
Computing the Burrows-Wheeler transform of a string and its reverse in parallel2014-04-01Paper
https://portal.mardi4nfdi.de/entity/Q53979022014-02-25Paper
Conditional term graph rewriting with indirect sharing2013-08-27Paper
Computing the longest common prefix array based on the Burrows-Wheeler transform2013-06-24Paper
Computing the Burrows-Wheeler Transform of a String and Its Reverse2012-08-14Paper
Bidirectional search in a string with wavelet trees and bidirectional matching statistics2012-05-24Paper
Lempel-Ziv Factorization Revisited2011-06-29Paper
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem2010-09-02Paper
Bidirectional Search in a String with Wavelet Trees2010-07-26Paper
Multiple Genome Alignment: Chaining Algorithms Revisited2010-04-06Paper
A Compressed Enhanced Suffix Array Supporting Fast String Matching2009-09-29Paper
A linear time algorithm for the inversion median problem in circular bacterial genomes2008-05-29Paper
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions2007-08-30Paper
Replacing suffix trees with enhanced suffix arrays2007-04-26Paper
Combinatorial Pattern Matching2005-12-14Paper
Chaining algorithms for multiple genome comparison2005-10-27Paper
https://portal.mardi4nfdi.de/entity/Q44313702003-10-22Paper
https://portal.mardi4nfdi.de/entity/Q44313492003-10-21Paper
https://portal.mardi4nfdi.de/entity/Q44101612003-07-02Paper
Hierarchical termination revisited.2003-01-21Paper
Relative undecidability in term rewriting. I: The termination hierarchy2003-01-14Paper
Relative undecidability in term rewriting. II: The confluence hierarchy2003-01-14Paper
https://portal.mardi4nfdi.de/entity/Q27667792002-07-09Paper
https://portal.mardi4nfdi.de/entity/Q27834162002-04-16Paper
Pushing the frontiers of combining rewrite systems farther outwards2002-04-03Paper
Implementing conditional term rewriting by graph rewriting2002-03-03Paper
Termination of logic programs: Transformational methods revisited2001-08-26Paper
https://portal.mardi4nfdi.de/entity/Q27239092001-07-08Paper
A uniform framework for term and graph rewriting applied to combined systems2000-10-26Paper
https://portal.mardi4nfdi.de/entity/Q45064002000-09-18Paper
https://portal.mardi4nfdi.de/entity/Q49544552000-06-07Paper
https://portal.mardi4nfdi.de/entity/Q49384212000-02-23Paper
https://portal.mardi4nfdi.de/entity/Q42237861999-03-11Paper
On the equivalence problem for E-pattern languages1998-06-30Paper
https://portal.mardi4nfdi.de/entity/Q43629151998-04-01Paper
https://portal.mardi4nfdi.de/entity/Q43643741997-11-17Paper
Termination is not modular for confluent variable-preserving term rewriting systems1997-02-28Paper
On the modularity of termination of term rewriting systems1997-02-27Paper
Modular properties of composable term rewriting systems1996-04-28Paper
https://portal.mardi4nfdi.de/entity/Q39709851992-06-25Paper

Research outcomes over time

This page was built for person: Enno Ohlebusch