An incomplex algorithm for fast suffix array construction (2008)
Softw Pract Exper, Klaus-bernd Schürmann, Jens Stoye
The suffix array of a string is a permutation of all starting positions of the string’s suffixes that are lexicographically sorted. We present a practical algorithm for suffix array construction...
Suffix Tree Construction and Storage with Limited Main Memory (2008)
Abteilung Informationstechnik, Klaus-bernd Schürmann, Jens Stoye, Impressum Herausgeber, Robert Giegerich, ...
Abstract. Suffix trees have been established as one of the most versatile index structures for unstructured string data like genomic sequences and other strings. In this work, our goal is the...
Suffix arrays in theory and practice (2007)
The suffix array of a string is a permutation of all starting positions of the string's suffixes in lexicographical order. In this thesis, we investigate mathematical and algorithmical aspects of...
Counting suffix arrays and strings (2005)
Schürmann, Klaus-Bernd, Stoye, Jens
Suffix arrays are used in various application and research areas like data compression or computational biology. In this work, our goal is to characterize the combinatorial properties of suffix...
Counting Suffix Arrays and Strings (2005)
Abteilung Informationstechnik, Klaus-bernd Schürmann, Jens Stoye, Impressum Herausgeber, Robert Giegerich, ...
Suffix arrays are used in various application and research areas like data compression or computational biology. In this work, our goal is to characterize the combinatorial properties of suffix...
Suffix tree construction and storage with limited main memory (2003)
Schürmann, Klaus-Bernd, Stoye, Jens
Suffix trees have been established as one of the most versatile index structures for unstructured string data like genomic sequences and other strings. In this work, our goal is the development of...