0
$\begingroup$

Given an alphabet with $n$ characters, and a list $L$ of sequences can we approximately find the shortest sequence that contains all sequences of $L$ as subsequences?

Very similar to the question here https://mathoverflow.net/questions/165303/shortest-supersequence-of-all-permutations-of-n-elements

$\endgroup$
1

0

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.