scientific article; zbMATH DE number 7696007

DOI10.4230/LIPICS.CPM.2021.21arXiv2004.01493MaRDI QIDQ6098794

Yasuo Tabei, Takaaki Nishimoto

Publication date: 14 June 2023

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Burrows-Wheeler transformenumeration algorithmmaximal repeatsminimal absent wordsminimal unique substrings

Mathematics Subject Classification ID

Algorithms on strings (68W32)

Related Items (2)

Accessing the suffix array via \(\phi^{-1}\)-forest ⋮ Sensitivity of string compressors and repetitiveness measures

This page was built for publication: