| 2008 |
|---|
| 48 | EE | Adrian Kügel,
Enno Ohlebusch:
A Space Efficient Solution to the Frequent String Mining Problem for Many Databases.
ECML/PKDD (1) 2008: 16 |
| 47 | EE | Simon Gog,
Martin Bader,
Enno Ohlebusch:
GENESIS: genome evolution scenarios.
Bioinformatics 24(5): 711-712 (2008) |
| 46 | EE | 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) |
| 45 | EE | Enno Ohlebusch,
Stefan Kurtz:
Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences.
Journal of Computational Biology 15(4): 357-377 (2008) |
| 2007 |
|---|
| 44 | EE | Enno Ohlebusch:
Conditional Term Graph Rewriting with Indirect Sharing.
Electr. Notes Theor. Comput. Sci. 72(1): 87-100 (2007) |
| 43 | EE | 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) |
| 42 | EE | Martin Bader,
Enno Ohlebusch:
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions.
Journal of Computational Biology 14(5): 615-636 (2007) |
| 2006 |
|---|
| 41 | EE | Martin Bader,
Enno Ohlebusch:
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions.
RECOMB 2006: 563-577 |
| 2005 |
|---|
| 40 | EE | Enno 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 |
| 38 | EE | Mohamed Ibrahim Abouelhoda,
Enno Ohlebusch:
Chaining algorithms for multiple genome comparison.
J. Discrete Algorithms 3(2-4): 321-341 (2005) |
| 2004 |
|---|
| 37 | EE | Mohamed Ibrahim Abouelhoda,
Stefan Kurtz,
Enno Ohlebusch:
Replacing suffix trees with enhanced suffix arrays.
J. Discrete Algorithms 2(1): 53-86 (2004) |
| 36 | EE | 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 |
|---|
| 35 | EE | Mohamed Ibrahim Abouelhoda,
Enno Ohlebusch:
Multiple Genome Alignment: Chaining Algorithms Revisited.
CPM 2003: 1-16 |
| 34 | EE | Mohamed 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 |
| 31 | EE | Mohamed Ibrahim Abouelhoda,
Enno Ohlebusch,
Stefan Kurtz:
Optimal Exact Strring Matching Based on Suffix Arrays.
SPIRE 2002: 31-43 |
| 30 | EE | Mohamed Ibrahim Abouelhoda,
Stefan Kurtz,
Enno Ohlebusch:
The Enhanced Suffix Array and Its Applications to Genome Analysis.
WABI 2002: 449-463 |
| 29 | EE | Alfons Geser,
Aart Middeldorp,
Enno Ohlebusch,
Hans Zantema:
Relative Undecidability in Term Rewriting: I. The Termination Hierarchy.
Inf. Comput. 178(1): 101-131 (2002) |
| 28 | EE | Alfons Geser,
Aart Middeldorp,
Enno Ohlebusch,
Hans Zantema:
Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy.
Inf. Comput. 178(1): 132-148 (2002) |
| 27 | EE | Enno Ohlebusch:
Hierarchical termination revisited.
Inf. Process. Lett. 84(4): 207-214 (2002) |
| 26 | EE | Jürgen Giesl,
Thomas Arts,
Enno Ohlebusch:
Modular Termination Proofs for Rewriting Using Dependency Pairs.
J. Symb. Comput. 34(1): 21-58 (2002) |
| 2001 |
|---|
| 25 | EE | Enno Ohlebusch:
Termination of Logic Programs: Transformational Methods Revisited.
Appl. Algebra Eng. Commun. Comput. 12(1/2): 73-116 (2001) |
| 24 | EE | Enno 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 |
| 22 | | Enno Ohlebusch,
Claus Claves,
Claude Marché:
TALP: A Tool for the Termination Analysis of Logic Programs.
RTA 2000: 270-273 |
| 21 | EE | Enno 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 |
| 19 | | Enno 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 |
|---|
| 17 | EE | Enno 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 |
|---|
| 15 | | Enno 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 |
| 13 | | Alfons Geser,
Aart Middeldorp,
Enno Ohlebusch,
Hans Zantema:
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules.
TAPSOFT 1997: 237-248 |
| 12 | EE | Enno Ohlebusch,
Esko Ukkonen:
On the Equivalence Problem for E-Pattern Languages.
Theor. Comput. Sci. 186(1-2): 231-248 (1997) |
| 1996 |
|---|
| 11 | | Alfons Geser,
Aart Middeldorp,
Enno Ohlebusch,
Hans Zantema:
Relative Undecidability in Term Rewriting.
CSL 1996: 150-166 |
| 10 | | Enno Ohlebusch,
Esko Ukkonen:
On the Equivalence Problem for E-Pattern Languages.
MFCS 1996: 457-468 |
| 1995 |
|---|
| 9 | | Bernd Bütow,
Robert Giegerich,
Enno Ohlebusch,
Stephan Thesing:
A New Strategy for Semantic Matching
PLILP 1995: 81-96 |
| 8 | EE | Enno 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 |
|---|
| 6 | | Enno 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) |
