Subsequence covers of words

DOI10.1007/978-3-031-20643-6_1MaRDI QIDQ6166966zbMATH OpenFDO

Authors Panagiotis Charalampopoulos, Solon P. Pissis, Jakub Radoszewski, Wojciech Rytter, Tomasz Waleń, 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

combinatorics on wordscoversshuffle powersstring algorithmssubsequence covers

Mathematics Subject Classification ID

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

Recommendations

• Absent subsequences in words
• Absent Subsequences in Words
• Covering arrays for some equivalence classes of words
• scientific article; zbMATH DE number 1877262
• Sequence covering arrays
• The subsequence composition of a string
• Longest common subsequences in sets of words
• Subword balance in binary words, languages and sequences
• Palindromic subsequences in finite words
• Publication:3469152

Cites work

• An on-line string superprimitivity test
• Efficient algorithms for shortest partial seeds in words
• Enhanced string covering
• Experimental evaluation of algorithms for computing quasiperiods
• Fast algorithm for partial covers in words
• scientific article; zbMATH DE number 1737190 (Why is no real title available?)
• On recognizing 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
• Unshuffling a square is NP-hard

Cited in

(2)

• Absent Subsequences in Words
• Subsequence covers of words

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 Q6166966)