A framework of dynamic data structures for string processing

DOI10.4230/LIPICS.SEA.2017.11MaRDI QIDQ4580155zbMATH OpenFDO

Authors Nicola Prezza

Publication date 13 August 2018

Full work available at URL https://arxiv.org/abs/1701.07238

zbMATH Keywords

dynamicdata structurecompressionstringC++bitvector

Mathematics Subject Classification ID

Data structures (68P05) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)

Recommendations

• Compressed Data Structures for Dynamic Sequences
• A Framework for Dynamizing Succinct Data Structures
• Dynamic Compressed Strings with Random Access
• A general framework for dynamic succinct and compressed data structures
• Dynamic relative compression, dynamic partial sums, and substring concatenation

Cited in

(12)

• Construction of Fundamental Data Structures for Strings
• Space-efficient B trees via load-balancing
• Dynamic Path-decomposed Tries
• DYNAMIC
• Refining the \(r\)-index
• A general framework for dynamic succinct and compressed data structures
• Border Array for Structural Strings
• A data structure for a sequence of string accesses in external memory
• A faster implementation of online RLBWT and its application to LZ77 parsing
• Dynamic relative compression, dynamic partial sums, and substring concatenation
• Dynamic relative compression, dynamic partial sums, and substring concatenation
• scientific article; zbMATH DE number 2087558 (Why is no real title available?)

Describes a project that uses

Uses Software

• sux
• bitvector
• dbwt
• ds-vector
• Memoria
• succinct
• libcds

This page was built for publication: A framework of dynamic data structures for string processing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580155)