String covers of a tree

DOI10.1007/978-3-030-86692-1_7MaRDI QIDQ2146126zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• String covers of a tree revisited
• scientific article; zbMATH DE number 1003283
• An optimal algorithm to compute all the covers of a string
• String Covering: A Survey
• The subtree max gap problem with application to parallel string covering

Cites work

• An on-line string superprimitivity test
• An optimal algorithm to compute all the covers of a string
• An output-sensitive algorithm for the minimization of 2-dimensional string covers
• Computing covers using prefix tables
• Efficient Computation of 2-Covers of a String.
• Efficient counting of square substrings in a tree
• Efficiently computing runs on a trie
• scientific article; zbMATH DE number 2086252 (Why is no real title available?)
• scientific article; zbMATH DE number 2052918 (Why is no real title available?)
• scientific article; zbMATH DE number 7695998 (Why is no real title available?)
• Indexing weighted sequences: neat and efficient
• Optimal superprimitivity testing for strings
• Palindromic complexity of trees
• String powers in trees
• Subquadratic-time algorithms for abelian stringology problems
• The maximum number of squares in a tree
• Universal reconstruction of a string

Cited in

(3)

• String Covering: A Survey
• String covers of a tree revisited
• Covers in optimal space

This page was built for publication: String covers of a tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2146126)