Succinct representation of labeled trees

Dekel Tsur

doi:10.1016/j.tcs.2014.10.006

Succinct representation of labeled trees

Dekel Tsur

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

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. (ISAAC 2012) [8] which is succinct only when the entropy of the labels is ω(1).

Original language	English
Pages (from-to)	320-329
Number of pages	10
Journal	Theoretical Computer Science
Volume	562
Issue number	C
DOIs	https://doi.org/10.1016/j.tcs.2014.10.006
State	Published - 1 Jan 2015

Keywords

Labeled trees
Succinct data-structures

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1016/j.tcs.2014.10.006

Cite this

@article{5264e6add10745a79c5d12c03fdc58f2,

title = "Succinct representation of labeled trees",

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. (ISAAC 2012) [8] which is succinct only when the entropy of the labels is ω(1).",

keywords = "Labeled trees, Succinct data-structures",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2014 Elsevier B.V.",

year = "2015",

month = jan,

day = "1",

doi = "10.1016/j.tcs.2014.10.006",

language = "English",

volume = "562",

pages = "320--329",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier B.V.",

number = "C",

}

TY - JOUR

T1 - Succinct representation of labeled trees

AU - Tsur, Dekel

PY - 2015/1/1

Y1 - 2015/1/1

N2 - 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. (ISAAC 2012) [8] which is succinct only when the entropy of the labels is ω(1).

AB - 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. (ISAAC 2012) [8] which is succinct only when the entropy of the labels is ω(1).

KW - Labeled trees

KW - Succinct data-structures

UR - http://www.scopus.com/inward/record.url?scp=84926332317&partnerID=8YFLogxK

U2 - 10.1016/j.tcs.2014.10.006

DO - 10.1016/j.tcs.2014.10.006

M3 - Article

AN - SCOPUS:84926332317

SN - 0304-3975

VL - 562

SP - 320

EP - 329

JO - Theoretical Computer Science

JF - Theoretical Computer Science

IS - C

ER -

Succinct representation of labeled trees

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this