Skip to main content

5 Result(s)

within Conference Paper Remove this filter Stefan Kurtz Remove this filter

and

  1. Chapter and Conference Paper

    Suffix trees in the functioned programming paradigm

    We explore the design space of implementing suffix tree algorithms in the functional paradigm. We review the linear time and space algorithms of McCreight and Ukkonen. Based on a new terminology of nested suff...

    Robert Giegerich, Stefan Kurtz in Programming Languages and Systems — ESOP '94 (1994)

    Download PDF (826 KB)

  2. No Access

    Chapter and Conference Paper

    Estimating the probability of approximate matches

    Stefan Kurtz, Gene Myers in Combinatorial Pattern Matching (1997)

  3. No Access

    Chapter and Conference Paper

    Efficient Implementation of Lazy Suffix Trees

    We present an efficient implementation of a write-only topdown construction for suffix trees. Our implementation is based on a new, space-efficient representation of suffix trees which requires only 12 bytes p...

    Robert Giegerich, Stefan Kurtz, Jens Stoye in Algorithm Engineering (1999)

  4. No Access

    Chapter and Conference Paper

    Optimal Exact String Matching Based on Suffix Arrays

    Using the suffix tree of a string S, decision queries of the type “Is P a substring of S?” can be answered in O(|P|) time and enumeration queries of the type “Where are all z occurrences of P in S?” can be answer...

    Mohamed Ibrahim Abouelhoda, Enno Ohlebusch… in String Processing and Information Retrieval (2002)

  5. No Access

    Chapter and Conference Paper

    The Enhanced Suffix Array and Its Applications to Genome Analysis

    In large scale applications as computational genome analysis, the space requirement of the suffix tree is a severe drawback. In this paper, we present a uniform framework that enables us to systematically repl...

    Mohamed Ibrahim Abouelhoda, Stefan Kurtz, Enno Ohlebusch in Algorithms in Bioinformatics (2002)