On representing the degree sequences of sublogarithmic-degree Wheeler graphs

DOI10.1007/978-3-031-20643-6_18zbMath1525.68039arXiv2204.07916MaRDI QIDQ6111590

Travis Gagie

Publication date: 4 August 2023

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05) Information storage and retrieval of data (68P20)

Cites Work

• A simple storage scheme for strings achieving entropy bounds
• Wheeler graphs: a framework for BWT-based data structures
• Adaptive succinctness
• Rank and select revisited and extended
• Succinct de Bruijn Graphs
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• Theory and practice of monotone minimal perfect hashing
• Partial sums on the ultra-wide word RAM

This page was built for publication: On representing the degree sequences of sublogarithmic-degree Wheeler graphs