The following pages link to Enno Ohlebusch (Q199245):
Displaying 49 items.
- (Q235205) (redirect page) (← links)
- Bidirectional search in a string with wavelet trees and bidirectional matching statistics (Q418161) (← links)
- Alphabet-independent algorithms for finding context-sensitive repeats in linear time (Q491149) (← links)
- Termination is not modular for confluent variable-preserving term rewriting systems (Q674186) (← links)
- Replacing suffix trees with enhanced suffix arrays (Q876707) (← links)
- A linear time algorithm for the inversion median problem in circular bacterial genomes (Q925057) (← links)
- Efficient algorithms for the all-pairs suffix-prefix problem and the all-pairs substring-prefix problem (Q990128) (← links)
- On the modularity of termination of term rewriting systems (Q1349693) (← links)
- On the equivalence problem for E-pattern languages (Q1389770) (← links)
- A uniform framework for term and graph rewriting applied to combined systems (Q1583048) (← links)
- Hierarchical termination revisited. (Q1853138) (← links)
- Relative undecidability in term rewriting. I: The termination hierarchy (Q1854559) (← links)
- Relative undecidability in term rewriting. II: The confluence hierarchy (Q1854560) (← links)
- Modular properties of composable term rewriting systems (Q1911401) (← links)
- Computing the longest common prefix array based on the Burrows-Wheeler transform (Q2376799) (← links)
- Computing the Burrows-Wheeler transform of a string and its reverse in parallel (Q2442813) (← links)
- Chaining algorithms for multiple genome comparison (Q2569405) (← links)
- Edge minimization in de Bruijn graphs (Q2672229) (← links)
- (Q2723909) (← links)
- (Q2766779) (← links)
- Pushing the frontiers of combining rewrite systems farther outwards (Q2782485) (← links)
- Advanced topics in term rewriting (Q2783416) (← links)
- Conditional term graph rewriting with indirect sharing (Q2843935) (← links)
- Computing the Burrows-Wheeler Transform of a String and Its Reverse (Q2904497) (← links)
- Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis (Q2942244) (← links)
- Lempel-Ziv Factorization Revisited (Q3011840) (← links)
- A Compressed Enhanced Suffix Array Supporting Fast String Matching (Q3399127) (← links)
- Multiple Genome Alignment: Chaining Algorithms Revisited (Q3550823) (← links)
- Bidirectional Search in a String with Wavelet Trees (Q3575235) (← links)
- Sorting by Weighted Reversals, Transpositions, and Inverted Transpositions (Q3596318) (← links)
- (Q3970985) (← links)
- (Q4223786) (← links)
- (Q4362915) (← links)
- (Q4364374) (← links)
- (Q4410161) (← links)
- (Q4431349) (← links)
- (Q4431370) (← links)
- (Q4506400) (← links)
- (Q4938421) (← links)
- (Q4954455) (← links)
- Compressed suffix trees (Q5178740) (← links)
- Fast and Lightweight LCP-Array Construction Algorithms (Q5233694) (← links)
- Space-Efficient Parallel Construction of Succinct Representations of Suffix Tree Topologies (Q5270943) (← links)
- (Q5397902) (← links)
- Combinatorial Pattern Matching (Q5713534) (← links)
- Combinations of simplifying conditional term rewriting systems (Q5881179) (← links)
- Termination of logic programs: Transformational methods revisited (Q5941754) (← links)
- Implementing conditional term rewriting by graph rewriting (Q5958126) (← links)
- On the computation of longest previous non-overlapping factors (Q6536266) (← links)
