I got a homework question as follows:

Use the Eulerian path approach to solve the Sequence by Hybridization problem for the following spectrum: S = {ATG,GGG,GGT,GTA,GTG, TAT, TGG} Label edges and vertices of the graph, and give all possible sequences s such that Spectrum(s, 3) = S.

The solution I tried is as follows:

GTGGGTATG

I found unbalanced Eulerian path and so I am a bit concerned. This is the only solution I got. I don't know if I can draw the graph here and show how I considered it. Can anyone help me to know if there can be any other solution other than this.

I hope I have put my question in more clear way, if didn't I will try to put it in other way.

so, BioStars is now answering homeworks ... :O

I vote to close this question.

It's from two years ago, hopefully the homework has been handed in by now...