Short Labels for Lowest Common Ancestors in Trees

We evaluate the practical performance of labeling schemes for lowest common ancestors in trees. We develop different variants for encoding the labels. We then perform a thorough experimental evaluation of these schemes on a variety of tree shapes and sizes. We find that in general non-prefix-free codes lead to shorter labels than those that are prefix-free, while having roughly the same query time.

• Type: Conference
• Year: 2009
• Where: ESA
• Authors: Johannes Fischer
• Keywords: Algorithms, Different Variants, ESA 2009, General Non-prefix-free Codes, Lowest Common Ancestors