Window Subsequence Problems for Compressed Texts
Given two strings (a text t of length n and a pattern p) and a natural number w, window subsequence problems consist in deciding whether p occurs as a subsequence of t and/or finding the number of size (at most) w windows of text t which contain pattern p as a subsequence, i.e. the letters of pattern p occur in the text window, in the same order as in p, but not necessarily consecutively (they may be interleaved with other letters). We are searching for subsequences in a text which is compressed using Lempel-Ziv-like compression algorithms, without decompressing the text, and we would like our algorithms to be almost optimal, in the sense that they run in time O(m) where m is the size of the compressed text. The pattern is uncompressed (because the compression algorithms are evolutive: various occurrences of a same pattern look different in the text).
KeywordsPattern Match Message Sequence Chart Text Size Compress Text Text Window
Unable to display preview. Download preview PDF.
- [L05]Lifshits, Y.: On the computational complexity of embedding of compressed texts, St.Petersburg State University Diploma thesis, (2005), http://logic.pdmi.ras.ru/~yura/en/diplomen.pdf
- [LL05]Lifshits, Y., Lohrey, M.: Querying and Embedding Compressed Texts (to appear, 2005)Google Scholar
- [Ma71]Matiyasevich, Y.: Real-time recognition of the inclusion relation. Zapiski Nauchnykh Leningradskovo Otdeleniya Mat. Inst. Steklova Akad. Nauk SSSR 20, 104–114 (1971); Translated into English, Journal of Soviet Mathematics 1, 64–70 (1973), http://logic.pdmi.ras.ru/~yumat/Journal
- [W84]Welch, T.: A technique for high performance data compresssion. Computer, 8–19 (June 1984)Google Scholar