We're sorry but this page doesn't work properly without JavaScript enabled. Please enable it to continue.
Feedback

PySDSL: Succinct data structures for python

Formal Metadata

Title
PySDSL: Succinct data structures for python
Alternative Title
Succinct data structures for python
Title of Series
Number of Parts
132
Author
License
CC Attribution - NonCommercial - ShareAlike 3.0 Unported:
You are free to use, adapt and copy, distribute and transmit the work or content in adapted or unchanged form for any legal and non-commercial purpose as long as the work is attributed to the author in the manner specified by the author or licensor and the work or content is shared also in adapted form only under the conditions of this
Identifiers
Publisher
Release Date2018
LanguageEnglish

Content Metadata

Subject Area
Genre
Abstract
This is a presentation of and call for participation in development and testing of Python bindings to Succinct Data Structure Library. From Wikipedia: Succinct data structures can represent an object (such as a bitvector or a tree) in space close to the information-theoretic lower bound of the object while supporting operations of the original object efficiently. The theoretical time complexity of an operation performed on the classical data structure and the equivalent succinct data structure are (most of the time) identical. Currently bindings are provided for: Mutable bit-compressed vectors Immutable compressed integer vectors Immutable compressed bit (boolean) vectors Rank and select operations on bitvectors Wavelet trees Comressed suffix arrays