Before revision:  Ferragina et al. presented the first entropy-compressed labeled tree representation (the XBWT) able to count, but not locate , paths labeled with a given pattern. Grammars and the Lempel-Ziv factorization have been extended to trees, but those representations do not support indexing queries. In this paper, we show for the first time how to support the powerful locate queries on compressed trees. We start by proposing suitable generalizations of  [  run-length  BWT , high-order entropy, and string attractors to cardinal trees (tries) .
After revision:  Ferragina et al. FOCS 2005 [ run-length BWT , high-order entropy, and string attractors to cardinal trees (tries) .