Category: Theoretical computer science

Study introduces O(log n)-time algorithms for Internal Pattern Matching queries on compressed and dynamic strings using recompression-based representations.