Explore succinct data structures for Python in this 25-minute EuroPython 2018 conference talk. Dive into the development and testing of Python bindings for the Succinct Data Structure Library. Learn about space-efficient representations of objects like bitvectors and trees that support efficient operations. Discover implementations for mutable bit-compressed vectors, immutable compressed integer and bit vectors, rank and select operations on bitvectors, wavelet trees, and compressed suffix arrays. Gain insights into bitvector compression, trees, integer vectors, bit rank and select operations, vector interleaving, wavelet trees, and suffix trees. Participate in the ongoing development of these Python bindings and contribute to enhancing data structure efficiency in Python programming.
Overview
Syllabus
Introduction
Bitvector
Compression
Trees
Integer vectors
One array
Classes in arrays
Bit vectors
Bit Rank and Bit Select
Bit Vector
Vector Interleaved
Wavelet Trees
Select Operations
Suffix Trees
Taught by
EuroPython Conference
