Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEnno Ohlebusch
Person information
- affiliation: University of Ulm, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j40]Uwe Baier, Thomas Büchler, Enno Ohlebusch, Pascal Weber:
Edge minimization in de Bruijn graphs. Inf. Comput. 285(Part): 104795 (2022)- [c45]Jannik Olbrich
, Enno Ohlebusch, Thomas Büchler:
On the Optimisation of the GSACA Suffix Array Construction Algorithm. SPIRE 2022: 99-113 - [p1]Timo Bingmann, Patrick Dinklage, Johannes Fischer, Florian Kurpicz, Enno Ohlebusch, Peter Sanders:
Scalable Text Index Construction. Algorithms for Big Data 2022: 252-284 - [i4]Jannik Olbrich, Enno Ohlebusch, Thomas Büchler:
On the Optimisation of the GSACA Suffix Array Construction Algorithm. CoRR abs/2206.12222 (2022) - 2021
- [c44]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: 21-29 - 2020
- [j39]Thomas Büchler, Enno Ohlebusch:
An improved encoding of genetic variation in a Burrows-Wheeler transform. Bioinform. 36(5): 1413-1419 (2020) - [j38]Kadir Dede, Enno Ohlebusch:
Dynamic construction of pan-genome subgraphs. Open Comput. Sci. 10(1): 82-96 (2020) - [c43]Uwe Baier, Thomas Büchler, Enno Ohlebusch, Pascal Weber:
Edge Minimization in de Bruijn Graphs. DCC 2020: 223-232
2010 – 2019
- 2019
- [c42]Enno Ohlebusch, Pascal Weber:
On the Computation of Longest Previous Non-overlapping Factors. SPIRE 2019: 372-381 - [i3]Uwe Baier, Thomas Büchler, Enno Ohlebusch, Pascal Weber:
Edge minimization in de Bruijn graphs. CoRR abs/1911.00044 (2019) - 2018
- [c41]Enno Ohlebusch, Stefan Stauß, Uwe Baier:
Trickier XBWT Tricks. SPIRE 2018: 325-333 - 2017
- [j37]Uwe Baier, Timo Beller, Enno Ohlebusch:
Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies. ACM J. Exp. Algorithmics 22 (2017) - [c40]Markus Mauer, Timo Beller, Enno Ohlebusch:
A Lempel-Ziv-style Compression Method for Repetitive Texts. Stringology 2017: 96-107 - 2016
- [j36]Timo Beller, Enno Ohlebusch:
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. Algorithms Mol. Biol. 11: 20 (2016) - [j35]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: 28:1-28:2 (2016) - [j34]Uwe Baier, Timo Beller, Enno Ohlebusch:
Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform. Bioinform. 32(4): 497-504 (2016) - [i2]Timo Beller, Enno Ohlebusch:
A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. CoRR abs/1602.03333 (2016) - 2015
- [j33]Enno Ohlebusch, Timo Beller:
Alphabet-independent algorithms for finding context-sensitive repeats in linear time. J. Discrete Algorithms 34: 23-36 (2015) - [c39]Timo Beller, Enno Ohlebusch:
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis. CPM 2015: 40-51 - [c38]Uwe Baier, Timo Beller, Enno Ohlebusch:
Parallel Construction of Succinct Representations of Suffix Tree Topologies. SPIRE 2015: 234-245 - 2014
- [j32]Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda:
Computing the Burrows-Wheeler transform of a string and its reverse in parallel. J. Discrete Algorithms 25: 21-33 (2014) - [c37]Enno Ohlebusch, Timo Beller:
Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time. SPIRE 2014: 117-128 - 2013
- [b3]Enno Ohlebusch:
Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction. Oldenbusch Verlag 2013, ISBN 978-3000413162, pp. 1-604 - [j31]Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger:
Computing the longest common prefix array based on the Burrows-Wheeler transform. J. Discrete Algorithms 18: 22-31 (2013) - [j30]Simon Gog, Enno Ohlebusch:
Compressed suffix trees: Efficient computation and storage of LCP-values. ACM J. Exp. Algorithmics 18 (2013) - [c36]Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch:
Space-Efficient Construction of the Burrows-Wheeler Transform. SPIRE 2013: 5-16 - 2012
- [j29]Thomas Schnattinger, Enno Ohlebusch, Simon Gog:
Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Inf. Comput. 213: 13-22 (2012) - [c35]Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda:
Computing the Burrows-Wheeler Transform of a String and Its Reverse. CPM 2012: 243-256 - [c34]Timo Beller, Katharina Berger, Enno Ohlebusch:
Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences. SPIRE 2012: 99-110 - 2011
- [j28]Michael Arnold, Enno Ohlebusch:
Linear Time Algorithms for Generalizations of the Longest Common Substring Problem. Algorithmica 60(4): 806-818 (2011) - [c33]Simon Gog, Enno Ohlebusch:
Fast and Lightweight LCP-Array Construction Algorithms. ALENEX 2011: 25-34 - [c32]Enno Ohlebusch, Simon Gog:
Lempel-Ziv Factorization Revisited. CPM 2011: 15-26 - [c31]Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger:
Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. SPIRE 2011: 197-208 - 2010
- [j27]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): 123-128 (2010) - [c30]Enno Ohlebusch, Simon Gog:
Space-efficient Genome Comparisons with Compressed Full-text Indexes. BICoB 2010: 19-24 - [c29]Thomas Schnattinger, Enno Ohlebusch, Simon Gog:
Bidirectional Search in a String with Wavelet Trees. CPM 2010: 40-50 - [c28]Enno Ohlebusch, Johannes Fischer, Simon Gog:
CST++. SPIRE 2010: 322-333 - [c27]Enno Ohlebusch, Simon Gog, Adrian Kügel:
Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. SPIRE 2010: 347-358 - [i1]Simon Gog, Enno Ohlebusch:
Lightweight LCP-Array Construction in Linear Time. CoRR abs/1012.4263 (2010)
2000 – 2009
- 2009
- [c26]Enno Ohlebusch, Simon Gog:
A Compressed Enhanced Suffix Array Supporting Fast String Matching. SPIRE 2009: 51-62 - 2008
- [j26]Simon Gog, Martin Bader, Enno Ohlebusch:
GENESIS: genome evolution scenarios. Bioinform. 24(5): 711-712 (2008) - [j25]Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch:
CoCoNUT: an efficient system for the comparison and analysis of genomes. BMC Bioinform. 9 (2008) - [j24]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) - [j23]Adrian Kügel, Enno Ohlebusch:
A space efficient solution to the frequent string mining problem for many databases. Data Min. Knowl. Discov. 17(1): 24-38 (2008) - [j22]Enno Ohlebusch, Stefan Kurtz:
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences. J. Comput. Biol. 15(4): 357-377 (2008) - [c25]Adrian Kügel, Enno Ohlebusch:
A Space Efficient Solution to the Frequent String Mining Problem for Many Databases. ECML/PKDD (1) 2008: 16 - 2007
- [j21]Martin Bader, Enno Ohlebusch:
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. J. Comput. Biol. 14(5): 615-636 (2007) - [j20]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): 637-646 (2007) - 2006
- [c24]Martin Bader, Enno Ohlebusch:
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. RECOMB 2006: 563-577 - 2005
- [j19]Mohamed Ibrahim Abouelhoda, Enno Ohlebusch:
Chaining algorithms for multiple genome comparison. J. Discrete Algorithms 3(2-4): 321-341 (2005) - [c23]Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp:
The Median Problem for the Reversal Distance in Circular Bacterial Genomes. CPM 2005: 116-127 - [c22]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: 29-43 - 2004
- [j18]Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch:
Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1): 53-86 (2004) - [j17]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) - 2003
- [j16]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): 105-123 (2003) - [c21]Mohamed Ibrahim Abouelhoda, Enno Ohlebusch:
Multiple Genome Alignment: Chaining Algorithms Revisited. CPM 2003: 1-16 - [c20]Mohamed Ibrahim Abouelhoda, Enno Ohlebusch:
A Local Chaining Algorithm and Its Applications in Comparative Genomics. WABI 2003: 1-16 - 2002
- [b2]Enno Ohlebusch:
Advanced topics in term rewriting. Springer 2002, ISBN 978-0-387-95250-5, pp. I-XV, 1-414 - [j15]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178(1): 101-131 (2002) - [j14]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178(1): 132-148 (2002) - [j13]Enno Ohlebusch:
Hierarchical termination revisited. Inf. Process. Lett. 84(4): 207-214 (2002) - [j12]Jürgen Giesl, Thomas Arts, Enno Ohlebusch:
Modular Termination Proofs for Rewriting Using Dependency Pairs. J. Symb. Comput. 34(1): 21-58 (2002) - [c19]Michael Höhl, Stefan Kurtz, Enno Ohlebusch:
Efficient multiple genome alignment. ISMB 2002: 312-320 - [c18]Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz:
Optimal Exact Strring Matching Based on Suffix Arrays. SPIRE 2002: 31-43 - [c17]Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch:
The Enhanced Suffix Array and Its Applications to Genome Analysis. WABI 2002: 449-463 - [c16]Enno Ohlebusch:
Conditional Term Graph Rewriting with Indirect Sharing. TERMGRAPH 2002: 87-100 - 2001
- [j11]Enno Ohlebusch:
Termination of Logic Programs: Transformational Methods Revisited. Appl. Algebra Eng. Commun. Comput. 12(1/2): 73-116 (2001) - [j10]Enno Ohlebusch:
Implementing conditional term rewriting by graph rewriting. Theor. Comput. Sci. 262(1): 311-331 (2001) - 2000
- [j9]Enno Ohlebusch:
A uniform framework for term and graph rewriting applied to combined systems. Inf. Process. Lett. 73(1-2): 53-59 (2000) - [c15]Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher, Jens Stoye, Robert Giegerich:
Computation and Visualization of Degenerate Repeats in Complete Genomes. ISMB 2000: 228-238 - [c14]Enno Ohlebusch, Claus Claves, Claude Marché:
TALP: A Tool for the Termination Analysis of Logic Programs. RTA 2000: 270-273
1990 – 1999
- 1999
- [j8]Bernd Bütow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing:
Semantic Matching for Left-Linear Convergent Rewrite Systems. J. Funct. Log. Program. 1999(11) (1999) - [c13]Enno Ohlebusch:
On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems. Fuji International Symposium on Functional and Logic Programming 1999: 179-193 - [c12]Enno Ohlebusch:
Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems. LPAR 1999: 111-130 - 1998
- [j7]Enno Ohlebusch:
Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof. Bull. EATCS 66: 171-177 (1998) - [c11]Jürgen Giesl, Enno Ohlebusch:
Pushing the Frontiers of Combining Rewrite Systems Farther Outwards. FroCoS 1998: 141-160 - [c10]Enno Ohlebusch:
Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation. RTA 1998: 17-31 - 1997
- [j6]Enno Ohlebusch, Esko Ukkonen:
On the Equivalence Problem for E-Pattern Languages. Theor. Comput. Sci. 186(1-2): 231-248 (1997) - [c9]Enno Ohlebusch:
Conditional Term Graph Rewriting. ALP/HOA 1997: 144-158 - [c8]Enno Ohlebusch:
A Filter Method for the Weighted Local Similarity Search Problem. CPM 1997: 191-205 - [c7]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT 1997: 237-248 - 1996
- [c6]Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema:
Relative Undecidability in Term Rewriting. CSL 1996: 150-166 - [c5]Enno Ohlebusch, Esko Ukkonen:
On the Equivalence Problem for E-Pattern Languages. MFCS 1996: 457-468 - 1995
- [j5]Enno Ohlebusch:
Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems. Inf. Process. Lett. 53(4): 223-228 (1995) - [j4]Enno Ohlebusch:
Modular Properties of Composable Term Rewriting Systems. J. Symb. Comput. 20(1): 1-41 (1995) - [c4]Bernd Bütow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing:
A New Strategy for Semantic Matching. PLILP 1995: 81-96 - 1994
- [b1]Enno Ohlebusch:
Modular properties of composable term rewriting systems. Bielefeld University, Germany, 1994, pp. 1-185 - [j3]Enno Ohlebusch:
On the Modularity of Termination of Term Rewriting Systems. Theor. Comput. Sci. 136(2): 333-360 (1994) - [c3]Enno Ohlebusch:
On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems. CAAP 1994: 261-275 - [c2]Enno Ohlebusch:
Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems. CTRS 1994: 296-315 - 1993
- [j2]Enno Ohlebusch:
A simple proof of sufficient conditions for the termination of the disjoint union of term rewriting systems. Bull. EATCS 50: 223-228 (1993) - 1992
- [c1]Enno Ohlebusch:
Combinations of Simplifying Conditional Term Rewriting Systems. CTRS 1992: 113-127 - 1991
- [j1]Robert Giegerich, Enno Ohlebusch:
An Implicit Representation of Infinite Sequences of Terms. Bull. EATCS 43: 174-182 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-03-22 23:55 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
