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 “"NE repeat"”.

  1. Efficient Implementation & Application of Maximal String Covering Algorithm

    … describes the development and application of the new software MAXCOVER that computes maximal covers and non-extendible repeats (a.k.a. “maximal repeats”). A string is a finite array x[1..n] of elements chosen from a set of totally ordered symbols called an alphabet. A repeat is a substring that …

    mcmaster Repository record for Efficient Implementation & Application of Maximal String Covering Algorithm (opens in a new tab)