The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Enno Ohlebusch" ( http://dblp.L3S.de/Authors/Enno_Ohlebusch )

URL (Homepage):  http://www.uni-ulm.de/in/theo/m/ohlebusch.html  Author page on DBLP  Author page in RDF  Community of Enno Ohlebusch in ASPL-2

Publication years (Num. hits)
1991-1997 (16) 1998-2002 (18) 2003-2008 (18) 2009-2013 (18) 2014-2018 (12)
Publication types (Num. hits)
article(40) book(2) inproceedings(39) phdthesis(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords

Results
Found 83 publication records. Showing 82 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Enno Ohlebusch, Stefan Stauß, Uwe Baier Trickier XBWT Tricks. Search on Bibsonomy SPIRE The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Uwe Baier, Timo Beller, Enno Ohlebusch Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Markus Mauer, Timo Beller, Enno Ohlebusch A Lempel-Ziv-style Compression Method for Repetitive Texts. Search on Bibsonomy Stringology The full citation details ... 2017 DBLP  BibTeX  RDF
1Timo Beller, Enno Ohlebusch A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. Search on Bibsonomy Algorithms for Molecular Biology The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Timo Beller, Enno Ohlebusch Erratum to: A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. Search on Bibsonomy Algorithms for Molecular Biology The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Uwe Baier, Timo Beller, Enno Ohlebusch Graphical pan-genome analysis with compressed suffix trees and the Burrows-Wheeler transform. Search on Bibsonomy Bioinformatics The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Timo Beller, Enno Ohlebusch A representation of a compressed de Bruijn graph for pan-genome analysis that enables search. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Enno Ohlebusch, Timo Beller Alphabet-independent algorithms for finding context-sensitive repeats in linear time. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Timo Beller, Enno Ohlebusch Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis. Search on Bibsonomy CPM The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Uwe Baier, Timo Beller, Enno Ohlebusch Parallel Construction of Succinct Representations of Suffix Tree Topologies. Search on Bibsonomy SPIRE The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda Computing the Burrows-Wheeler transform of a string and its reverse in parallel. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Timo Beller Alphabet-Independent Algorithms for Finding Context-Sensitive Repeats in Linear Time. Search on Bibsonomy SPIRE The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Simon Gog, Enno Ohlebusch Compressed suffix trees: Efficient computation and storage of LCP-values. Search on Bibsonomy ACM Journal of Experimental Algorithmics The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger Computing the longest common prefix array based on the Burrows-Wheeler transform. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch Bioinformatics Algorithms: Sequence Analysis, Genome Rearrangements, and Phylogenetic Reconstruction Search on Bibsonomy 2013   RDF
1Timo Beller, Maike Zwerger, Simon Gog, Enno Ohlebusch Space-Efficient Construction of the Burrows-Wheeler Transform. Search on Bibsonomy SPIRE The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Thomas Schnattinger, Enno Ohlebusch, Simon Gog Bidirectional search in a string with wavelet trees and bidirectional matching statistics. Search on Bibsonomy Inf. Comput. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Timo Beller, Mohamed Ibrahim Abouelhoda Computing the Burrows-Wheeler Transform of a String and Its Reverse. Search on Bibsonomy CPM The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Timo Beller, Katharina Berger, Enno Ohlebusch Space-Efficient Computation of Maximal and Supermaximal Repeats in Genome Sequences. Search on Bibsonomy SPIRE The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Michael Arnold, Enno Ohlebusch Linear Time Algorithms for Generalizations of the Longest Common Substring Problem. Search on Bibsonomy Algorithmica The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Simon Gog Lempel-Ziv Factorization Revisited. Search on Bibsonomy CPM The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Simon Gog, Enno Ohlebusch Fast and Lightweight LCP-Array Construction Algorithms. Search on Bibsonomy ALENEX The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Timo Beller, Simon Gog, Enno Ohlebusch, Thomas Schnattinger Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform. Search on Bibsonomy SPIRE The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Simon Gog Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Simon Gog, Enno Ohlebusch Lightweight LCP-Array Construction in Linear Time Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Thomas Schnattinger, Enno Ohlebusch, Simon Gog Bidirectional Search in a String with Wavelet Trees. Search on Bibsonomy CPM The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Johannes Fischer 0001, Simon Gog CST++. Search on Bibsonomy SPIRE The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Simon Gog, Adrian Kügel Computing Matching Statistics and Maximal Exact Matches on Compressed Full-Text Indexes. Search on Bibsonomy SPIRE The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Simon Gog Space-efficient Genome Comparisons with Compressed Full-text Indexes. Search on Bibsonomy BICoB The full citation details ... 2010 DBLP  BibTeX  RDF
1Enno Ohlebusch, Simon Gog A Compressed Enhanced Suffix Array Supporting Fast String Matching. Search on Bibsonomy SPIRE The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Adrian Kügel, Enno Ohlebusch A space efficient solution to the frequent string mining problem for many databases. Search on Bibsonomy Data Min. Knowl. Discov. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF String mining, Enhanced suffix array
1Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch CoCoNUT: an efficient system for the comparison and analysis of genomes. Search on Bibsonomy BMC Bioinformatics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Martin Bader, Mohamed Ibrahim Abouelhoda, Enno Ohlebusch A fast algorithm for the multiple genome rearrangement problem with weighted reversals and transpositions. Search on Bibsonomy BMC Bioinformatics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Simon Gog, Martin Bader, Enno Ohlebusch GENESIS: genome evolution scenarios. Search on Bibsonomy Bioinformatics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Stefan Kurtz Space Efficient Computation of Rare Maximal Exact Matches between Multiple Sequences. Search on Bibsonomy Journal of Computational Biology The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Adrian Kügel, Enno Ohlebusch A Space Efficient Solution to the Frequent String Mining Problem for Many Databases. Search on Bibsonomy ECML/PKDD (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch Conditional Term Graph Rewriting with Indirect Sharing. Search on Bibsonomy Electr. Notes Theor. Comput. Sci. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel A linear time algorithm for the inversion median problem in circular bacterial genomes. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Martin Bader, Enno Ohlebusch Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. Search on Bibsonomy Journal of Computational Biology The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Martin Bader, Enno Ohlebusch Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions. Search on Bibsonomy RECOMB The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Mohamed Ibrahim Abouelhoda, Enno Ohlebusch Chaining algorithms for multiple genome comparison. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Mohamed Ibrahim Abouelhoda, Kathrin Hockel, Jan Stallkamp The Median Problem for the Reversal Distance in Circular Bacterial Genomes. Search on Bibsonomy CPM The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Christian Wawra, Mohamed Ibrahim Abouelhoda, Enno Ohlebusch Efficient mapping of large cDNA/EST databases to genomes: A comparison of two different strategies. Search on Bibsonomy German Conference on Bioinformatics The full citation details ... 2005 DBLP  BibTeX  RDF
1Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch Replacing suffix trees with enhanced suffix arrays. Search on Bibsonomy J. Discrete Algorithms The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Michael 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. Search on Bibsonomy J. Integrative Bioinformatics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Patrick Chain, Stefan Kurtz, Enno Ohlebusch, Tom Slezak An Applications-focused Review of Comparative Genomics Tools: Capabilities, Limitations and Future Challenges. Search on Bibsonomy Briefings in Bioinformatics The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Mohamed Ibrahim Abouelhoda, Enno Ohlebusch Multiple Genome Alignment: Chaining Algorithms Revisited. Search on Bibsonomy CPM The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Mohamed Ibrahim Abouelhoda, Enno Ohlebusch A Local Chaining Algorithm and Its Applications in Comparative Genomics. Search on Bibsonomy WABI The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch Hierarchical termination revisited. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Jürgen Giesl, Thomas Arts, Enno Ohlebusch Modular Termination Proofs for Rewriting Using Dependency Pairs. Search on Bibsonomy J. Symb. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema Relative Undecidability in Term Rewriting: I. The Termination Hierarchy. Search on Bibsonomy Inf. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema Relative Undecidability in Term Rewriting: II. The Confluence Hierarchy. Search on Bibsonomy Inf. Comput. The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch Advanced topics in term rewriting. Search on Bibsonomy 2002   RDF
1Michael Höhl, Stefan Kurtz, Enno Ohlebusch Efficient multiple genome alignment. Search on Bibsonomy ISMB The full citation details ... 2002 DBLP  BibTeX  RDF
1Mohamed Ibrahim Abouelhoda, Enno Ohlebusch, Stefan Kurtz Optimal Exact Strring Matching Based on Suffix Arrays. Search on Bibsonomy SPIRE The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch The Enhanced Suffix Array and Its Applications to Genome Analysis. Search on Bibsonomy WABI The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch Termination of Logic Programs: Transformational Methods Revisited. Search on Bibsonomy Appl. Algebra Eng. Commun. Comput. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF Logic programs, Transformations, Termination, Term rewriting systems
1Enno Ohlebusch Implementing conditional term rewriting by graph rewriting. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch A uniform framework for term and graph rewriting applied to combined systems. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Stefan Kurtz, Enno Ohlebusch, Chris Schleiermacher, Jens Stoye, Robert Giegerich Computation and Visualization of Degenerate Repeats in Complete Genomes. Search on Bibsonomy ISMB The full citation details ... 2000 DBLP  BibTeX  RDF
1Enno Ohlebusch, Claus Claves, Claude Marché TALP: A Tool for the Termination Analysis of Logic Programs. Search on Bibsonomy RTA The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Bernd Bütow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing Semantic Matching for Left-Linear Convergent Rewrite Systems Search on Bibsonomy Journal of Functional and Logic Programming The full citation details ... 1999 DBLP  BibTeX  RDF
1Enno Ohlebusch Transforming Conditional Rewrite Systems with Extra Variables into Unconditional Systems. Search on Bibsonomy LPAR The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems. Search on Bibsonomy Fuji International Symposium on Functional and Logic Programming The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch Modularity of Termination for Disjoint Term Graph Rewrite Systems: A Simple Proof. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1998 DBLP  BibTeX  RDF
1Enno Ohlebusch Church-Rosser Theorems for Abstract Reduction Modulo an Equivalence Relation. Search on Bibsonomy RTA The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Esko Ukkonen On the Equivalence Problem for E-Pattern Languages. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch Conditional Term Graph Rewriting. Search on Bibsonomy ALP/HOA The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch A Filter Method for the Weighted Local Similarity Search Problem. Search on Bibsonomy CPM The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema Relative Undecidability in the Termination Hierarchy of Single Rewrite Rules. Search on Bibsonomy TAPSOFT The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch, Esko Ukkonen On the Equivalence Problem for E-Pattern Languages. Search on Bibsonomy MFCS The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Alfons Geser, Aart Middeldorp, Enno Ohlebusch, Hans Zantema Relative Undecidability in Term Rewriting. Search on Bibsonomy CSL The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems. Search on Bibsonomy Inf. Process. Lett. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch Modular Properties of Composable Term Rewriting Systems. Search on Bibsonomy J. Symb. Comput. The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Bernd Bütow, Robert Giegerich, Enno Ohlebusch, Stephan Thesing A New Strategy for Semantic Matching Search on Bibsonomy PLILP The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch On the Modularity of Termination of Term Rewriting Systems. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch Modular Properties of Constructor-Sharing Conditional Term Rewriting Systems. Search on Bibsonomy CTRS The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch On the Modularity of Confluence of Constructor-Sharing Term Rewriting Systems. Search on Bibsonomy CAAP The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Enno Ohlebusch Modular properties of composable term rewriting systems. Search on Bibsonomy 1994   RDF
1Enno Ohlebusch A simple proof of sufficient conditions for the termination of the disjoint union of term rewriting systems. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1993 DBLP  BibTeX  RDF
1Enno Ohlebusch Combinations of Simplifying Conditional Term Rewriting Systems. Search on Bibsonomy CTRS The full citation details ... 1992 DBLP  DOI  BibTeX  RDF
1Robert Giegerich, Enno Ohlebusch An Implicit Representation of Infinite Sequences of Terms. Search on Bibsonomy Bulletin of the EATCS The full citation details ... 1991 DBLP  BibTeX  RDF
Displaying result #1 - #82 of 82 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license