Near-optimal computation of runs over general alphabet via non-crossing LCE queries

DOI10.1007/978-3-319-46049-9_3zbMath1397.68238arXiv1606.08275OpenAlexW2468020159WikidataQ61677831 ScholiaQ61677831MaRDI QIDQ1796824

Ritu Kundu, Solon P. Pissis, Maxime Crochemore, Wojciech Rytter, Jakub Radoszewski, Tomasz Kociumaka, Costas S. Iliopoulos, Tomasz Walen

Publication date: 17 October 2018

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms on strings (68W32)

Related Items (5)

Optimal bounds for computing \({\alpha}\)-gapped repeats ⋮ Cartesian and Lyndon trees ⋮ Computing runs on a trie ⋮ On the size of overlapping Lempel-Ziv and Lyndon factorizations ⋮ Computing the maximum exponent in a stream

This page was built for publication: Near-optimal computation of runs over general alphabet via non-crossing LCE queries