Shorter strings containing all k-element permutations

DOI10.1016/J.IPL.2011.03.018MaRDI QIDQ1944962zbMATH OpenOpenAlexFDO

Authors Eugen Zălinescu

Publication date 28 March 2013

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2011.03.018

zbMATH Keywords

combinatorial problemspermutationssubsequences

Mathematics Subject Classification ID

Permutations, words, matrices (05A05) Combinatorics on words (68R15)

Recommendations

• scientific article; zbMATH DE number 4168689
• Shortest prefix strings containing all subset permutations
• Containing all permutations
• Non-uniqueness of minimal superpermutations
• A construction of short sequences containing all permutations of a set as subsequences

Cites work

• On Permutation-Embedding Sequences
• Short permutation strings
• Short strings containing all k-element permutations
• Shortest string containing all permutations
• Shortest string containing all permutations

Cited in

(7)

• Shortest prefix strings containing all subset permutations
• Fixing monotone Boolean networks asynchronously
• Skip letters for short supersequence of all permutations
• scientific article; zbMATH DE number 4168689 (Why is no real title available?)
• Non-uniqueness of minimal superpermutations
• scientific article; zbMATH DE number 617582 (Why is no real title available?)
• Containing all permutations

This page was built for publication: Shorter strings containing all \(k\)-element permutations

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