This is the source code for my master's thesis on Scalable Distributed String Sorting Algorithms at the Karlsruhe Institute of Technology — Institute of Theoretical Informatics, Algorithm Engineering.

You are given a string $s$ of length $n$. The prefix function for this string is defined as an array $\pi$ of length $n$, where $\pi[i]$ is the length of the longest ...

Abstract: String matching is a basic problem of computer science and it has been widely used in many important application fields. To date, QF is one of the fastest exact single pattern string ...

Course Description: Provides an in-depth look at modern algorithms used to process string data, particularly those relevant to genomics. The course will cover the design and analysis of efficient ...

Course Relevance: Undergraduate and graduate students who have interest in algorithm techniques for large-scale and sequence processing. Graduate and undergraduate students in computational biology.

Abstract: The paper presents three new algorithms for multiple string pattern matching using hashing tables: a suffix search (SS), a suffix-prefix search (SPS), and a suffix-middle-prefix search (SMPS ...

ABSTRACT: String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost ...

ABSTRACT: Edit distance measures the similarity between two strings (as the minimum number of change, insert or delete operations that transform one string to the other). An edit sequence s is a ...