Subsequence covers of words

DOI10.1016/J.TCS.2025.115216MaRDI QIDQ6988592zbMATH OpenFDO

Authors Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, Wiktor Zuba

Publication date 4 May 2025

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2025.115216

zbMATH Keywords

combinatorics on wordscoversshuffle powerssubsequencetext algorithms

Mathematics Subject Classification ID

Combinatorics on words (68R15) Algorithms on strings (68W32)

Cites work

• An on-line string superprimitivity test
• Enhanced string covering
• Experimental evaluation of algorithms for computing quasiperiods
• Fast algorithm for partial covers in words
• Growth of power-free languages over large alphabets
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• Linear time construction of cover suffix tree and applications
• On recognising words that are squares for the shuffle product
• On the complexity of iterated shuffle
• Optimal superprimitivity testing for strings
• Recognizing binary shuffle squares is \textsf{NP}-hard
• Searching of gapped repeats and subrepetitions in a word
• String Covering: A Survey
• Subsequence covers of words
• Unshuffling a square is NP-hard

This page was built for publication: Subsequence covers of words

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