Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Enno Ohlebusch
2010 – today
- 2013
[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)- 2012
- [j30]Thomas Schnattinger, Enno Ohlebusch, Simon Gog: Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Inf. Comput. 213: 13-22 (2012)
- [c33]Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda: Computing the Burrows-Wheeler Transform of a String and Its Reverse. CPM 2012: 243-256
- [c32]Timo Beller, Katharina Berger, Enno Ohlebusch: Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences. SPIRE 2012: 99-110
- 2011
- [j29]Michael Arnold, Enno Ohlebusch: Linear Time Algorithms for Generalizations of the Longest Common Substring Problem. Algorithmica 60(4): 806-818 (2011)
- [c31]Simon Gog, Enno Ohlebusch: Fast and Lightweight LCP-Array Construction Algorithms. ALENEX 2011: 25-34
- [c30]
- [c29]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
- [j28]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)
- [c28]Enno Ohlebusch, Simon Gog: Space-efficient Genome Comparisons with Compressed Full-text Indexes. BICoB 2010: 19-24
- [c27]Thomas Schnattinger, Enno Ohlebusch, Simon Gog: Bidirectional Search in a String with Wavelet Trees. CPM 2010: 40-50
- [c26]
- [c25]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
- [c24]Enno Ohlebusch, Simon Gog: A Compressed Enhanced Suffix Array Supporting Fast String Matching. SPIRE 2009: 51-62
- 2008
- [j27]Simon Gog, Martin Bader, Enno Ohlebusch: GENESIS: genome evolution scenarios. Bioinformatics 24(5): 711-712 (2008)
- [j26]Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch: CoCoNUT: an efficient system for the comparison and analysis of genomes. BMC Bioinformatics 9 (2008)
- [j25]Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohlebusch: A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions. BMC Bioinformatics 9 (2008)
- [j24]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)
- [j23]Enno Ohlebusch, Stefan Kurtz: Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences. Journal of Computational Biology 15(4): 357-377 (2008)
- [c23]Adrian Kügel, Enno Ohlebusch: A Space Efficient Solution to the Frequent String Mining Problem for Many Databases. ECML/PKDD (1) 2008: 16
- 2007
- [j22]Enno Ohlebusch: Conditional Term Graph Rewriting with Indirect Sharing. Electr. Notes Theor. Comput. Sci. 72(1): 87-100 (2007)
- [j21]Martin Bader, Enno Ohlebusch: Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. Journal of Computational Biology 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
- [c22]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)
- [c21]Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp: The Median Problem for the Reversal Distance in Circular Bacterial Genomes. CPM 2005: 116-127
- [c20]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. Integrative Bioinformatics 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 in Bioinformatics 4(2): 105-123 (2003)
- [c19]Mohamed Ibrahim Abouelhoda, Enno Ohlebusch: Multiple Genome Alignment: Chaining Algorithms Revisited. CPM 2003: 1-16
- [c18]Mohamed Ibrahim Abouelhoda, Enno Ohlebusch: A Local Chaining Algorithm and Its Applications in Comparative Genomics. WABI 2003: 1-16
- 2002
- [b1]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]
- [j12]Jürgen Giesl, Thomas Arts, Enno Ohlebusch: Modular Termination Proofs for Rewriting Using Dependency Pairs. J. Symb. Comput. 34(1): 21-58 (2002)
- [c17]
- [c16]Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz: Optimal Exact Strring Matching Based on Suffix Arrays. SPIRE 2002: 31-43
- [c15]Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch: The Enhanced Suffix Array and Its Applications to Genome Analysis. WABI 2002: 449-463
- 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)
- [c14]Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher, Jens Stoye, Robert Giegerich: Computation and Visualization of Degenerate Repeats in Complete Genomes. ISMB 2000: 228-238
- [c13]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. Journal of Functional and Logic Programming 1999(11) (1999)
- [c12]Enno Ohlebusch: On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems. Fuji International Symposium on Functional and Logic Programming 1999: 179-193
- [c11]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. Bulletin of the EATCS 66: 171-177 (1998)
- [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]
- [c8]
- [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
- [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. Bulletin of the EATCS 50: 223-228 (1993)
- 1992
- [c1]
- 1991
- [j1]Robert Giegerich, Enno Ohlebusch: An Implicit Representation of Infinite Sequences of Terms. Bulletin of the EATCS 43: 174-182 (1991)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-14 21:59 CET by the dblp team