Sequence By Hybridization And Eulerian Path Approach
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.
0 answers
No answers yet.
Log in to answer this question.
More posts like this
-
Getting conversant with R
written by makoye •
-
DNA to peptide translation and adding to csv file
written by Sara
-
No out put from python function
written by ThulasiS
-
mRNA Translation: TGG/UGG as a start codon?
written by rebelCoder •
-
Reading frames in python
written by Gonçalo •
-
Basic genes codon count in R with seqinr
written by monlawski •
-
SNPEFF genome build with specific codon usage
written by Stephane Plaisance
-
Convert a FASTA Amino Acid Sequence to RNA (Reverse Central Dogma)
written by incensefrenzie2006 •
-
DNA to protein in python
written by ashkan
-
Perl help regarding hash
written by ksi216 •
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...