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 1 of 1 for “"Maximal Closed Substrings"”.

  1. EFFICIENT COMPUTATION OF CLOSED SUBSTRINGS

    A \df{closed string} $ u $ is either of length one or contains a border that occurs only as a prefix and as a suffix of $ u $, without appearing elsewhere within $ u $. This thesis presents a fast and practical $ \mathcal{O}(n \log n) $ time algorithm to compute all $ \mathcal{O}(n^2) $ closed …

    mcmaster Repository record for EFFICIENT COMPUTATION OF CLOSED SUBSTRINGS (opens in a new tab)