dblp.uni-trier.dewww.uni-trier.de

Enno Ohlebusch Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
Home Page

*2009
51EEEnno Ohlebusch, Simon Gog: A Compressed Enhanced Suffix Array Supporting Fast String Matching. SPIRE 2009: 51-62
2008
50EEAdrian Kügel, Enno Ohlebusch: A Space Efficient Solution to the Frequent String Mining Problem for Many Databases. ECML/PKDD (1) 2008: 16
49EEMartin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohlebusch: A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions. BMC Bioinformatics 9: (2008)
48EEMohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch: CoCoNUT: an efficient system for the comparison and analysis of genomes. BMC Bioinformatics 9: (2008)
47EESimon Gog, Martin Bader, Enno Ohlebusch: GENESIS: genome evolution scenarios. Bioinformatics 24(5): 711-712 (2008)
46EEAdrian 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)
45EEEnno Ohlebusch, Stefan Kurtz: Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences. Journal of Computational Biology 15(4): 357-377 (2008)
2007
44EEEnno Ohlebusch: Conditional Term Graph Rewriting with Indirect Sharing. Electr. Notes Theor. Comput. Sci. 72(1): 87-100 (2007)
43EEEnno 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)
42EEMartin Bader, Enno Ohlebusch: Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. Journal of Computational Biology 14(5): 615-636 (2007)
2006
41EEMartin Bader, Enno Ohlebusch: Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. RECOMB 2006: 563-577
2005
40EEEnno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp: The Median Problem for the Reversal Distance in Circular Bacterial Genomes. CPM 2005: 116-127
39 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
38EEMohamed Ibrahim Abouelhoda, Enno Ohlebusch: Chaining algorithms for multiple genome comparison. J. Discrete Algorithms 3(2-4): 321-341 (2005)
2004
37EEMohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch: Replacing suffix trees with enhanced suffix arrays. J. Discrete Algorithms 2(1): 53-86 (2004)
36EEMichael 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
35EEMohamed Ibrahim Abouelhoda, Enno Ohlebusch: Multiple Genome Alignment: Chaining Algorithms Revisited. CPM 2003: 1-16
34EEMohamed Ibrahim Abouelhoda, Enno Ohlebusch: A Local Chaining Algorithm and Its Applications in Comparative Genomics. WABI 2003: 1-16
33 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)
2002
32 Michael Höhl, Stefan Kurtz, Enno Ohlebusch: Efficient multiple genome alignment. ISMB 2002: 312-320
31EEMohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz: Optimal Exact Strring Matching Based on Suffix Arrays. SPIRE 2002: 31-43
30EEMohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch: The Enhanced Suffix Array and Its Applications to Genome Analysis. WABI 2002: 449-463
29EEAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Inf. Comput. 178(1): 101-131 (2002)
28EEAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Inf. Comput. 178(1): 132-148 (2002)
27EEEnno Ohlebusch: Hierarchical termination revisited. Inf. Process. Lett. 84(4): 207-214 (2002)
26EEJürgen Giesl, Thomas Arts, Enno Ohlebusch: Modular Termination Proofs for Rewriting Using Dependency Pairs. J. Symb. Comput. 34(1): 21-58 (2002)
2001
25EEEnno Ohlebusch: Termination of Logic Programs: Transformational Methods Revisited. Appl. Algebra Eng. Commun. Comput. 12(1/2): 73-116 (2001)
24EEEnno Ohlebusch: Implementing conditional term rewriting by graph rewriting. Theor. Comput. Sci. 262(1): 311-331 (2001)
2000
23 Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher, Jens Stoye, Robert Giegerich: Computation and Visualization of Degenerate Repeats in Complete Genomes. ISMB 2000: 228-238
22EEEnno Ohlebusch, Claus Claves, Claude Marché: TALP: A Tool for the Termination Analysis of Logic Programs. RTA 2000: 270-273
21EEEnno Ohlebusch: A uniform framework for term and graph rewriting applied to combined systems. Inf. Process. Lett. 73(1-2): 53-59 (2000)
1999
20 Enno Ohlebusch: On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems. Fuji International Symposium on Functional and Logic Programming 1999: 179-193
19EEEnno Ohlebusch: Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems. LPAR 1999: 111-130
18 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)
1998
17EEEnno Ohlebusch: Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation. RTA 1998: 17-31
16 Enno Ohlebusch: Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof. Bulletin of the EATCS 66: 171-177 (1998)
1997
15EEEnno Ohlebusch: Conditional Term Graph Rewriting. ALP/HOA 1997: 144-158
14 Enno Ohlebusch: A Filter Method for the Weighted Local Similarity Search Problem. CPM 1997: 191-205
13EEAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. TAPSOFT 1997: 237-248
12EEEnno Ohlebusch, Esko Ukkonen: On the Equivalence Problem for E-Pattern Languages. Theor. Comput. Sci. 186(1-2): 231-248 (1997)
1996
11EEAlfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema: Relative Undecidability in Term Rewriting. CSL 1996: 150-166
10EEEnno Ohlebusch, Esko Ukkonen: On the Equivalence Problem for E-Pattern Languages. MFCS 1996: 457-468
1995
9EEBernd Bütow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing: A New Strategy for Semantic Matching PLILP 1995: 81-96
8EEEnno Ohlebusch: Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems. Inf. Process. Lett. 53(4): 223-228 (1995)
7 Enno Ohlebusch: Modular Properties of Composable Term Rewriting Systems. J. Symb. Comput. 20(1): 1-41 (1995)
1994
6EEEnno Ohlebusch: On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems. CAAP 1994: 261-275
5 Enno Ohlebusch: Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems. CTRS 1994: 296-315
4 Enno Ohlebusch: On the Modularity of Termination of Term Rewriting Systems. Theor. Comput. Sci. 136(2): 333-360 (1994)
1993
3 Enno Ohlebusch: A simple proof of sufficient conditions for the termination of the disjoint usion of term rewriting systems. Bulletin of the EATCS 50: 223-228 (1993)
1992
2 Enno Ohlebusch: Combinations of Simplifying Conditional Term Rewriting Systems. CTRS 1992: 113-127
1991
1 Robert Giegerich, Enno Ohlebusch: An Implicit Representation of Infinite Sequences of Terms. Bulletin of the EATCS 43: 174-182 (1991)

Coauthor Index

1Mohamed Ibrahim Abouelhoda [30] [31] [34] [35] [37] [38] [39] [40] [43] [48] [49]
2Thomas Arts [26]
3Martin Bader [41] [42] [47] [49]
4Michael Beckstette [36]
5Bernd Bütow [9] [18]
6Patrick Chain [33]
7Claus Claves [22]
8Alfons Geser [11] [13] [28] [29]
9Robert Giegerich [1] [9] [18] [23] [36]
10Jürgen Giesl [26]
11Simon Gog [47] [51]
12Kathrin Hockel [40] [43]
13Michael Höhl [32]
14Adrian Kügel [46] [50]
15Stefan Kurtz [23] [30] [31] [32] [33] [37] [45] [48]
16Jens T. Mailänder [36]
17Claude Marché [22]
18Richard J. Marhöfer [36]
19Aart Middeldorp [11] [13] [28] [29]
20Chris Schleiermacher [23]
21Alexander Sczyrba [36]
22Paul M. Selzer [36]
23Tom Slezak [33]
24Jan Stallkamp [40]
25Jens Stoye [23]
26Stephan Thesing [9] [18]
27Esko Ukkonen [10] [12]
28Christian Wawra [39]
29Hans Zantema [11] [13] [28] [29]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)