TY - GEN
T1 - Tree compression with top trees
AU - Bille, Philip
AU - Gørtz, Inge Li
AU - Landau, Gad M.
AU - Weimann, Oren
PY - 2013
Y1 - 2013
N2 - We introduce a new compression scheme for labeled trees based on top trees [3]. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time.
AB - We introduce a new compression scheme for labeled trees based on top trees [3]. Our compression scheme is the first to simultaneously take advantage of internal repeats in the tree (as opposed to the classical DAG compression that only exploits rooted subtree repeats) while also supporting fast navigational queries directly on the compressed representation. We show that the new compression scheme achieves close to optimal worst-case compression, can compress exponentially better than DAG compression, is never much worse than DAG compression, and supports navigational queries in logarithmic time.
UR - http://www.scopus.com/inward/record.url?scp=84880254966&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-39206-1_14
DO - 10.1007/978-3-642-39206-1_14
M3 - Conference contribution
AN - SCOPUS:84880254966
SN - 9783642392054
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 160
EP - 171
BT - Automata, Languages, and Programming - 40th International Colloquium, ICALP 2013, Proceedings
T2 - 40th International Colloquium on Automata, Languages, and Programming, ICALP 2013
Y2 - 8 July 2013 through 12 July 2013
ER -