String covers of a tree revisited

DOI10.1007/978-3-031-43980-3_24MaRDI QIDQ6545440zbMATH OpenFDO

Authors Łukasz Kondraciuk

Publication date 29 May 2024

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Algorithms on strings (68W32)

Recommendations

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

Cites work

• scientific article; zbMATH DE number 43417 (Why is no real title available?)
• scientific article; zbMATH DE number 1522932 (Why is no real title available?)
• An on-line string superprimitivity test
• Efficient counting of square substrings in a tree
• Efficient detection of quasiperiodicities in strings
• Efficiently computing runs on a trie
• Experimental evaluation of algorithms for computing quasiperiods
• Introduction to algorithms
• Optimal superprimitivity testing for strings
• Palindromic complexity of trees
• String covers of a tree
• String powers in trees
• The maximum number of squares in a tree
• Tight bound for the number of distinct palindromes in a tree

Cited in

(2)

• String covers of a tree
• Solving string problems on graphs using the labeled direct product

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

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