In this paper we present DYNAMIC, an open-source C++ library implementing dynamic compressed data structures for string manipulation. Our framework includes useful tools such as searchable partial sums, succinct/gap-encoded bitvectors, and entropy/run-length compressed strings and FM indexes. We prove close-to-optimal theoretical bounds for the resources used by our structures, and show that our theoretical predictions are empirically tightly verified in practice. To conclude, we turn our attention to applications. We compare the performance of five recently-published compression algorithms implemented using DYNAMIC with those of stateof-the-art tools performing the same task. Our experiments show that algorithms making use of dynamic compressed data structures can be up to three orders of magnitude more space-efficient (albeit slower) than classical ones performing the same tasks.
|Data di pubblicazione:||2017|
|Titolo:||A framework of dynamic data structures for string processing|
|Titolo del libro:||16th Symposium on Experimental Algorithms, SEA 2017, Leibniz International Proceedings in Informatics, LIPIcs|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.4230/LIPIcs.SEA.2017.11|
|Appare nelle tipologie:||4.1 Articolo in Atti di convegno|
File in questo prodotto: