Cycles · Application: Genome Assembly and de Bruijn Graphs

Lesson 3

Nikolai Chukhin · Alexander S. Kulikov

Problem. What is the length of the shortest string that contains all the strings \(\texttt{AGC}\), \(\texttt{ATC}\), \(\texttt{CAG}\), \(\texttt{CAT}\), \(\texttt{CCA}\), \(\texttt{GCA}\), \(\texttt{TCA}\), \(\texttt{TCC}\) as substrings?

5 points