Enno Ohlebusch
Nucleic Acids Research · 2001–2004
A researcher in the Science corpus: 3 papers; trusts 1 researcher and is trusted by 16 researchers here, as inferred from the citation graph.
Whom Enno Ohlebusch trusts overall
Their strongest outbound trust, strongest first, inferred from their citations.
Who trusts Enno Ohlebusch overall
Papers from Enno Ohlebusch's perspective
Ordered by how strongly the researchers Enno Ohlebusch trusts endorse each paper. Same corpus, a different order for every researcher.
- Opportunistic data structures with applications
- A Block-sorting Lossless Data Compression Algorithm
- Suffix arrays: a new method for on-line string searches
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract) (Symposium on the Theory of Computing)
- Fast algorithms for large-scale genome alignment and comparison. (Nucleic Acids Research)
- The LCA Problem Revisited (Latin American Symposium on Theoretical Informatics)
- Simple Linear Work Suffix Array Construction
- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications (Annual Symposium on Combinatorial Pattern Matching)
- REPuter: the manifold applications of repeat analysis on a genomic scale. (Nucleic Acids Research)
- Space efficient linear time construction of suffix arrays
Their papers
- REPuter: the manifold applications of repeat analysis on a genomic scale. (2001) — 2,193 citations
- Replacing suffix trees with enhanced suffix arrays (2004) — 775 citations
- Term Rewriting Systems (2002) — 1,098 citations