2000 character limit reached
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries (1706.03035v1)
Published 9 Jun 2017 in cs.DS
Abstract: We present the first thorough practical study of the Lempel-Ziv-78 and the Lempel-Ziv-Welch computation based on trie data structures. With a careful selection of trie representations we can beat well-tuned popular trie data structures like Judy, m-Bonsai or Cedar.