Enno Ohlebusch

PROFILE

Homepage
No homepage is listed.
ORCID
No ORCID is listed.
Affiliations
No affiliations are listed.
Aliases
No aliases are listed.
Publication record
107 papers · 6,520 citations · H-index 28

PAPERS

The TAG array of a multiple sequence alignment
20252 citationsauthor #2
Generating multiple alignments on a pangenomic scale
20255 citationsauthor #3
Generating Multiple Alignments of Genomes of the Same Species
20251 citationsauthor #3
A Taxonomy of LCP-Array Construction Algorithms
20252 citationsauthor #2
Faster Computation of Chinese Frequent Strings and Their Net Frequencies
20244 citationsauthor #1
Generic Non-recursive Suffix Array Construction
20247 citationsauthor #2
Efficient short read mapping to a pangenome that is represented by a graph of ED strings
202316 citationsauthor #3
Scalable Text Index Construction
20224 citationsauthor #5
On the Optimisation of the GSACA Suffix Array Construction Algorithm
20225 citationsauthor #2
Coordinate Systems for Pangenome Graphs based on the Level Function and Minimum Path Covers
20211 citationsauthor #4
Dynamic construction of pan-genome subgraphs
20205 citationsauthor #2
Edge Minimization in de Bruijn Graphs
20192 citationsauthor #3
An improved encoding of genetic variation in a Burrows-Wheeler transform
20198 citationsauthor #2
On the Computation of Longest Previous Non-overlapping Factors
20191 citationsauthor #1
A Brief List Of Thesis Topics (Bachelor)
20180 citationsauthor #1
Trickier XBWT Tricks
20185 citationsauthor #1
Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies
20173 citationsauthor #3
A Lempel-Ziv-style Compression Method for Repetitive Texts
20176 citationsauthor #3
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
201620 citationsauthor #2
Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform
201655 citationsauthor #3
Advanced Topics in Terlll Rewriting With 43 Figures
20160 citationsauthor #1
Erratum to: A representation of a compressed de Bruijn graph for pan-genome analysis that enables search
20162 citationsauthor #2
Lempel-Ziv Factorization : LZ 77 without Window
20160 citationsauthor #1
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis
201518 citationsauthor #2
Parallel Construction of Succinct Representations of Suffix Tree Topologies
20152 citationsauthor #3
Alphabet-independent algorithms for finding context-sensitive repeats in linear time
20147 citationsauthor #1
Computing the Burrows-Wheeler transform of a string and its reverse in parallel
20149 citationsauthor #1
Space-Efficient Construction of the Burrows-Wheeler Transform
201323 citationsauthor #4
Compressed suffix trees: Efficient computation and storage of LCP-values
201322 citationsauthor #2
Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction
201394 citationsauthor #1
Computing the Burrows-Wheeler Transform of a String and Its Reverse
20121 citationsauthor #1
Bidirectional search in a string with wavelet trees and bidirectional matching statistics
201242 citationsauthor #2
Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences
201218 citationsauthor #3
Computing the longest common prefix array based on the Burrows-Wheeler transform
201154 citationsauthor #3
Lempel-Ziv Factorization Revisited
201146 citationsauthor #1
Linear Time Algorithms for Generalizations of the Longest Common Substring Problem
201136 citationsauthor #2
Fast and Lightweight LCP-Array Construction Algorithms
201147 citationsauthor #2
Bidirectional Search in a String with Wavelet Trees
201032 citationsauthor #2
Space-efficient Genome Comparisons with Compressed Full-text Indexes
20101 citationsauthor #1
Lightweight LCP-Array Construction in Linear Time
20103 citationsauthor #2
Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes
201064 citationsauthor #1
Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem
201035 citationsauthor #1
A Compressed Enhanced Suffix Array Supporting Fast String Matching
200930 citationsauthor #1
A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions
200823 citationsauthor #3
CoCoNUT: an efficient system for the comparison and analysis of genomes
200825 citationsauthor #3
A Space E(cid:30)cient Solution to the Frequent String Mining Problem for Many Databases
200815 citationsauthor #2
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences
200822 citationsauthor #1
Conditional Term Graph Rewriting with Indirect Sharing
20070 citationsauthor #1
A linear time algorithm for the inversion median problem in circular bacterial genomes
20075 citationsauthor #1
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
200652 citationsauthor #2
Enhanced Suffix Arrays and Applications
200516 citationsauthor #3
The Median Problem for the Reversal Distance in Circular Bacterial Genomes
20059 citationsauthor #1
Chaining algorithms for multiple genome comparison
200574 citationsauthor #2
Efficient mapping of large cDNA/EST databases to genomes: A comparison of two different strategies
20052 citationsauthor #3
An applications-focused review of comparative genomics tools : Capabilities , limitations and future challenges
20050 citationsauthor #3
Genlight: Interactive high-throughput sequence analysis and comparative genomics
200410 citationsauthor #5
Replacing suffix trees with enhanced suffix arrays
2004768 citationsauthor #3
CHAINER: Software for Comparing Genomes
200415 citationsauthor #2
Chaining Algorithms and Applications in Comparative Genomics
200425 citationsauthor #1
Multiple Genome Alignment: Chaining Algorithms Revisited
200320 citationsauthor #2
An Applications-focused Review of Comparative Genomics Tools: Capabilities, Limitations and Future Challenges
200384 citationsauthor #3
A Local Chaining Algorithm and Its Applications in Comparative Genomics
200328 citationsauthor #2
The Enhanced Suffix Array and Its Applications to Genome Analysis
2002158 citationsauthor #3
Abstract Reduction Systems
20023 citationsauthor #1
Efficient multiple genome alignment
2002188 citationsauthor #3
Term Rewriting Systems
20021,081 citationsauthor #1
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy
20029 citationsauthor #3
Optimal exact string matching based on su x arrays
20028 citationsauthor #2
Advanced Topics in Term Rewriting
2002279 citationsauthor #1
Proving Termination of Logic Programs
20020 citationsauthor #1
Relative undecidability in term rewriting: I. the termination Hierarchy
20028 citationsauthor #3
Modular Termination Proofs for Rewriting Using Dependency Pairs
200292 citationsauthor #3
Optimal Exact Strring Matching Based on Suffix Arrays
200291 citationsauthor #2
Hierarchical termination revisited
200218 citationsauthor #1
Conditional Rewrite Systems
20020 citationsauthor #1
REPuter: the manifold applications of repeat analysis on a genomic scale.
20012,116 citationsauthor #3
Termination of Logic Programs: Transformational Methods Revisited
200155 citationsauthor #1
Implementing conditional term rewriting by graph rewriting
20016 citationsauthor #1
Computation and Visualization of Degenerate Repeats in Complete Genomes
200063 citationsauthor #2
A uniform framework for term and graph rewriting applied to combined systems
20003 citationsauthor #1
TALP: A Tool for the Termination Analysis of Logic Programs
200037 citationsauthor #1
Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems
199926 citationsauthor #1
On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems
19993 citationsauthor #1
Semantic Matching for Left-Linear Convergent Rewrite Systems
19991 citationsauthor #3
Pushing the Frontiers of Combining Rewrite Systems Farther Outwards
199812 citationsauthor #2
Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof
19984 citationsauthor #1
Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation
199834 citationsauthor #1
Conditional Term Graph Rewriting
19974 citationsauthor #1
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules
19978 citationsauthor #3
A Filter Method for the Weighted Local Similarity Search Problem
19971 citationsauthor #1
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy
199612 citationsauthor #3
On the Equivalence Problem for E-Pattern Languages
199628 citationsauthor #1
Forschungsberichte Der Technischen Fakult at Abteilung Informationstechnik Static and Dynamic Filtering Methods for Approximate String Matching Static and Dynamic Filtering Methods for Approximate String Matching
19960 citationsauthor #4
On the Equivalence Problem for E-pattern Languages
19961 citationsauthor #1
Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems
199514 citationsauthor #1
A New Strategy for Semantic Matching
19950 citationsauthor #3
Modular Properties of Composable Term Rewriting Systems
199580 citationsauthor #1
On the Modularity of Termination of Term Rewriting Systems
199463 citationsauthor #1
On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems
199426 citationsauthor #1
Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems
199410 citationsauthor #1

TIMELINE

1991 0 citations

1992 26 citations

1993 13 citations

1994 99 citations

1995 94 citations

1996 41 citations

1997 13 citations

1998 50 citations

1999 30 citations

2000 103 citations

2001 2,177 citations

2002 1,935 citations

2003 132 citations

2004 818 citations

2005 101 citations

2006 52 citations

2007 5 citations

2008 85 citations

2009 30 citations

2010 135 citations

2011 183 citations

2012 61 citations

2013 139 citations

2014 16 citations

2015 20 citations

2016 77 citations

2017 9 citations

2018 5 citations

2019 11 citations

2020 5 citations

2021 1 citations

2022 9 citations

2023 16 citations

2024 11 citations

2025 10 citations

Unknown 7 citations

Enno Ohlebusch

PROFILE

PAPERS

TIMELINE

COAUTHOR MAP

CONCEPT FOOTPRINT