Wavelet Trees Meet Suffix Trees

DOI10.1137/1.9781611973730.39zbMath1372.68070arXiv1408.6182OpenAlexW3105495033MaRDI QIDQ5362987

Tomasz Kociumaka, Paweł Gawrychowski, Tatiana Starikovskaya, Maxim A. Babenko

Publication date: 5 October 2017

Published in: Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Data structures (68P05) Algorithms on strings (68W32)

Related Items (11)

Fast construction of wavelet trees ⋮ Computing minimal and maximal suffixes of a substring ⋮ Order-preserving indexing ⋮ Parallel lightweight wavelet tree, suffix array and FM-index construction ⋮ Internal shortest absent word queries in constant time and linear space ⋮ Practical Wavelet Tree Construction ⋮ Absent Subsequences in Words ⋮ Unnamed Item ⋮ Efficient indexes for jumbled pattern matching with constant-sized alphabet ⋮ Internal dictionary matching ⋮ Improved parallel construction of wavelet trees and rank/select structures

This page was built for publication: Wavelet Trees Meet Suffix Trees