Fast parameterized pattern matching algorithms based on data compression

点击翻译按钮获取中文摘要

A sequence of characters or symbols is called a string. Many digital data can be regarded as a string. In order to process and utilize large-scale data, we proposed efficient string processing algorithms that are both fast and memory efficient. In particular, we developed efficient algorithms that work on strings given as straight-line programs (SLPs). We achieved fast and memory efficient solutions by an approach called compressed string processing, where given compressed data is not explicitly decompressed. The results of our work have been published in internal journals/proceedings, and presented in international/domestic conferences.