Browse by: : Advisor | Referee | Advisor & Referee

Now showing items 1-3 of 3

    • Algorithms for Matching and Analysis Problems on Subsequences 

      Kosche, Maria (2024-10-14)
      The focus of this thesis is on the study of efficient algorithms and computational complexity results for matching and analysis problems on subsequences. The presented results comprise algorithmic solutions and lower ...
    • On Combinatorial Properties of Subsequences 

      Koß, Tore (2024-08-22)
      A word, also known as string, is a sequence of letters, while a subsequence of a word w is another word u which can be obtained by deleting some of the letters of w. Words in general, and subsequences in particular, play ...
    • Matching Patterns with Variables in Approximate Settings 

      Siemer, Stefan (2024-02-12)
      In the literature dealing with patterns with variables, a word, also called string, is a sequence of terminal letters, while a pattern is a sequence of terminal and variable letters. The problem of deciding if there is a ...