%0 Generic %1 tsur2013succinct %A Tsur, Dekel %D 2013 %K succinct %T Succinct representation of labeled trees %U http://arxiv.org/abs/1312.6039 %X We give a representation for labeled ordered trees that supports labeled queries such as finding the i-th ancestor of a node with a given label. Our representation is succinct, namely the redundancy is small-o of the optimal space for storing the tree. This improves the representation of He et al. which is succinct unless the entropy of the labels is small.

@misc{tsur2013succinct, abstract = {We give a representation for labeled ordered trees that supports labeled queries such as finding the i-th ancestor of a node with a given label. Our representation is succinct, namely the redundancy is small-o of the optimal space for storing the tree. This improves the representation of He et al. which is succinct unless the entropy of the labels is small.}, added-at = {2013-12-24T07:23:14.000+0100}, author = {Tsur, Dekel}, biburl = {https://www.bibsonomy.org/bibtex/2b9be68afad1e66847876f783e2ff7a8b/yoh-okuno}, description = {Succinct representation of labeled trees}, interhash = {7a84be27601236ad7a48ff34f1a25a42}, intrahash = {b9be68afad1e66847876f783e2ff7a8b}, keywords = {succinct}, note = {cite arxiv:1312.6039}, timestamp = {2013-12-24T07:23:14.000+0100}, title = {Succinct representation of labeled trees}, url = {http://arxiv.org/abs/1312.6039}, year = 2013 }