Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 4 of 4 for “"Suffix Sorting"”.

  1. Direct suffix sorting and its applications

    The suffix sorting problem is to construct the suffix array for an input sequence. Given a sequence T[0... n -- 1] of size n = |T|, with symbols from a fixed alphabet Sigma, (|Sigma| ≤ n), the suffix array provides a compact representation of all the suffixes of T in a lexicographic order. …

    wvu Repository record for Direct suffix sorting and its applications (opens in a new tab)

  2. Computing Lyndon Arrays

    … Franek et al. showed a linear co-equivalence of sorting suffixes and sorting maximal Lyndon substrings of a string (inspired by a novel suffix sorting algorithm of Baier). In 2016, Franek et al. presented a brief overview of algorithms for com- puting the Lyndon array that encodes the knowledge …

    mcmaster Repository record for Computing Lyndon Arrays (opens in a new tab)

  3. Parameterized Strings: Algorithms and Data Structures

    … only if prev(S) == prev(T). In order to utilize suffix data structures in terms of p-matching, we must account for the dynamic nature of the parameterized suffixes (p-suffixes) of T, namely prev(T[ i...n]) ∀ i, 1 ≤ i ≤ n.;In this work, we propose transformative approaches to the direct …

    wvu Repository record for Parameterized Strings: Algorithms and Data Structures (opens in a new tab)

  4. Suffix trees and suffix arrays in primary and secondary storage

    … To speed up the runtime of these algorithms, suffix trees and suffix arrays are routinely used to generate a set of starting positions quickly and/or narrow down the set of possibilities need to be considered.;The first contribution of this dissertation is a linear time algorithm to sort all …

    iastate Repository record for Suffix trees and suffix arrays in primary and secondary storage (opens in a new tab)