Authors: Köppl, Dominik
Title: Exploring regular structures in strings
Language (ISO): en
Abstract: This thesis is dedicated to string processing algorithms and to combinatorics on words. With respect to the former, we devise Lempel-Ziv (LZ) factorization and sparse suffix sorting algorithms. With respect to the latter, we search for all distinct squares, all maximal α-gapped repeats, and all maximal α-gapped palindromes. The topics of the presented approaches are related: for instance, our results for the LZ factorization have applications for finding all distinct squares, whereas our sparse suffix sorting algorithm profits from finding gapped repeats. The results can contribute to tools for data compression, for text indexing, and for the analysis of biological sequences.
Subject Headings: Lempel-Ziv
Sparse Suffix Sorting
Combinatorics on words
Subject Headings (RSWK): Kombinatorik
Zeichenkette
URI: http://hdl.handle.net/2003/37054
http://dx.doi.org/10.17877/DE290R-19051
Issue Date: 2018
Appears in Collections:LS 11

Files in This Item:
File Description SizeFormat 
dissertation_dominik_koeppl.pdfDNB2.92 MBAdobe PDFView/Open


This item is protected by original copyright



All resources in the repository are protected by copyright.