Shorter strings containing all k-element permutations

DOI10.1016/J.IPL.2011.03.018zbMATH Open1260.68315OpenAlexW2134460193MaRDI QIDQ1944962FDOQ1944962

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

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

zbMATH Keywords

permutationscombinatorial problemssubsequences

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Shortest prefix strings containing all subset permutations
• Containing all permutations
• Title not available (Why is that?)
• Skip letters for short supersequence of all permutations
• Fixing monotone Boolean networks asynchronously
• Non-uniqueness of minimal superpermutations

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)