Abstract
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. © 2009 Springer Berlin Heidelberg.
Cite
CITATION STYLE
Fischer, J. (2009). Short labels for lowest common ancestors in trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5757 LNCS, pp. 752–763). https://doi.org/10.1007/978-3-642-04128-0_67
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
