A framework of DYNAMIC data structures for string processing

Nicola Prezza

Research output: Contribution to journalJournal articleResearchpeer-review

187 Downloads (Pure)


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.
Original languageEnglish
JournalLeibniz International Proceedings in Informatics
Number of pages15
Publication statusPublished - 2017


Dive into the research topics of 'A framework of DYNAMIC data structures for string processing'. Together they form a unique fingerprint.

Cite this