String covers of a tree

DOI10.1007/978-3-030-86692-1_7OpenAlexW3203667602MaRDI QIDQ2146126

Wiktor Zuba, Juliusz Straszyński, Wojciech Rytter, Jakub Radoszewski, Tomasz Walen

Publication date: 15 June 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-86692-1_7

Mathematics Subject Classification ID

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

Related Items

String Covering: A Survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing covers using prefix tables
• Optimal superprimitivity testing for strings
• Efficiently computing runs on a trie
• An on-line string superprimitivity test
• An optimal algorithm to compute all the covers of a string
• Covering problems for partial words and for indeterminate strings
• String powers in trees
• Efficient counting of square substrings in a tree
• Indexing weighted sequences: neat and efficient
• Universal reconstruction of a string
• An output-sensitive algorithm for the minimization of 2-dimensional string covers
• Subquadratic-Time Algorithms for Abelian Stringology Problems
• The Maximum Number of Squares in a Tree
• Palindromic Complexity of Trees
• Efficient Computation of 2-Covers of a String.