Fast relative LempelZiv self-index for similar sequences
Recent advances in biotechnology and web technology are continuously generating huge collections of similar strings. People now face the problem of storing them compactly while supporting fast pattern searching. One compression scheme called relative LempelZiv compression uses textual substitutions from a reference text to represent each string in S as a concatenation of substrings from a reference string R. This basic scheme gives a good compression ratio when every string in S is similar to R, but does not provide any pattern searching functionality. Here, we describe a new data structure based on relative LempelZiv compression that is space-efficient and also supports fast pattern searching.
textual substitution string decomposition exact pattern searching fm-index suffix range rank and select