Efficiently computing runs on a trie
type: Item
instance of: scholarly article
title: Efficiently computing runs on a trie
author: Ryo Sugahara
author: Yuto Nakashima
author: Shunsuke Inenaga
author: Hideo Bannai
author: Masayuki Takeda
published in: Theoretical Computer Science
publication date: 2021-09-27T00:00:00Z
full work available at URL: https://arxiv.org/abs/1901.10633
Mathematics Subject Classification ID: 68Qxx
zbMATH DE Number: 7401214
zbMATH Keywords: maximal repetitions
zbMATH Keywords: Lyndon words
zbMATH Keywords: trie
MaRDI profile type: Publication
OpenAlex ID: W3184027729
cites work: The “Runs” Theorem
cites work: Computing runs on a trie
cites work: Efficient counting of square substrings in a tree
cites work: The Maximum Number of Squares in a Tree
cites work: String powers in trees
cites work: The maximal number of cubic runs in a word
cites work: Extracting powers and periods in a word from its runs structure
cites work: A linear-time algorithm for a special case of disjoint set union
cites work: Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
cites work: Longest common extensions in trees
cites work: The suffix tree of a tree and minimizing sequential transducers
cites work: The level ancestor problem simplified
cites work: Q3565863
cites work: Q4511228
cites work: Q4508365
DOI: 10.1016/J.TCS.2021.07.011
description: scientific article; zbMATH DE number 7401214