Ohlebusch, Enno - Institut f�r Theoretische Informatik, Universit�t Ulm

Advanced Search

Ohlebusch, Enno - Institut f�r Theoretische Informatik, Universit�t Ulm

A Local Chaining Algorithm and its Applications in Comparative Genomics
The Enhanced Suffix Array and Its Applications to Genome Analysis
The Median Problem for the Reversal Distance in Circular Bacterial Genomes
Enhanced Suffix Arrays and Applications
Efficient mapping of large cDNA/EST databases to genomes: A comparison of two different strategies
Multiple Genome Alignment: Chaining Algorithms Revisited
Chaining Algorithms and Applications in Comparative
Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions
Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems
Conditional Term Graph Rewriting Enno Ohlebusch
Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules
Relative Undecidability in Term Rewriting Alfons Geser 1 , Aart Middeldorp 2 , Enno Ohlebusch 3 , Hans Zantema 4
On QuasiReductive and QuasiSimplifying Deterministic Conditional Rewrite Systems
Computation and Visualization of Degenerate Repeats in Complete Genomes
This is page xiii Printer: Opaque this
Modular Properties of ConstructorSharing Conditional Term Rewriting Systems
TALP: A Tool for the Termination Analysis of Logic Programs
Combinations of Simplifying Conditional Term Rewriting Systems
Pushing the Frontiers of Combining Rewrite Systems Farther Outwards
A General Technique to Improve Filter Algorithms for Approximate String Matching
A New Calculus for Semantic Matching ? Bernd Butow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing
On the Equivalence Problem for EPattern (Extended Abstract)
On the Modularity of Confluence of ConstructorSharing Term Rewriting Systems
A Filter Method for the Weighted Local Similarity Search Problem
ChurchRosser Theorems for Abstract Reduction Modulo an Equivalence Relation
Optimal Exact String Matching Based on Suffix Arrays