We study quantum algorithms for several fundamental string problems, including Longest
Common Substring, Lexicographically Minimal String Rotation, and Longest Square …

This thesis is devoted to algorithms and data structures for classical problems in stringology
in the internal and dynamic settings. In the internal setting, the task is to preprocess a string …

The simplicity of strings and their impactful usage puts their processing at the heart of many
applications, including Bioinformatics, Information Retrieval, and Cybersecurity. Exact …

We design near-optimal quantum query algorithms for two important text processing
problems: Longest Common Substring and Lexicographically Minimal String Rotation …

A string is a sequence of symbols derived from a given alphabet Σ. The early stages of the
research focused on ordinary pattern matching and several associated variants. For …