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 “"Longest common subsequences with blocks"”.

  1. Topics on the length of the longest common subsequences, with blocks, in binary random words

    The study of LIn, the length of the longest increasing subsequences, and of LCIn, the length of the longest common and increasing subsequences in random words is classical in computer science and bioinformatics, and has been well explored over the last few decades. This dissertation studies a …

    gatech Repository record for Topics on the length of the longest common subsequences, with blocks, in binary random words (opens in a new tab)