Queries on LZ-Bounded Encodings
  We describe a data structure that stores a string $S$ in space similar to that of its Lempel-Ziv encoding and efficiently supports access, rank and select queries. These queries are fundamental for implementing succinct and compressed data structures, such as compressed trees and graphs. We show that our data structure can be built in a scalable manner and is both small and fast in practice compared to other data structures supporting such queries. 
Djamal Belazzougui, Travis Gagie, Pawe{\l} Gawrychowski, Juha   K\"arkk\"ainen, Alberto Ord\'o\~nez, Simon J. Puglisi, and Y...
cs.DS