研究室紹介

Strings are concepts that generalize sequential data such as text, time series, labeled trees/graphs, and 2D arrays. Our research interests are in designing fast and space-efficient algorithms for processing strings, with particular emphasis on their theoretical perspectives. Since the discovery of classical algorithms including KMP, suffix trees, and LZ compression, string algorithmics has been one of the most important sub-fields in theoretical computer science. In the real world, string algorithms are commonly utilized as core building blocks of information retrieval systems and data compression programs. Further, string-related problems are commonly seen in competitive programming contests. Our approach for tackling massive sequential data is first to reveal mathematical properties of strings using the theory of "word combinatorics”, and then to develop advanced "algorithms and data structures” techniques.