Subsequence covers of words

DOI10.1007/978-3-031-20643-6_1zbMath1525.68202MaRDI QIDQ6166966

Wojciech Rytter, Tomasz Walen, Solon P. Pissis, Jakub Radoszewski, Panagiotis Charalampopoulos, Wiktor Zuba

Publication date: 4 August 2023

Published in: String Processing and Information Retrieval (Search for Journal in Brave)

Full work available at URL: https://ir.cwi.nl/pub/32638

zbMATH Keywords

coversstring algorithmscombinatorics on wordsshuffle powerssubsequence covers

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Enhanced string covering
• Fast algorithm for partial covers in words
• On the complexity of iterated shuffle
• Optimal superprimitivity testing for strings
• An on-line string superprimitivity test
• Efficient algorithms for shortest partial seeds in words
• Experimental evaluation of algorithms for computing quasiperiods
• Recognizing binary shuffle squares is \textsf{NP}-hard
• Unshuffling a square is NP-hard
• On Recognizing Words That Are Squares for the Shuffle Product
• Searching of Gapped Repeats and Subrepetitions in a Word