Unformatted text preview: AU G with G. Since the abnormal fragment doesn't split, we CCUG look for Eulerian trails or circuits whose last vertex is G. The unique chain is UCAGCCUGGAUG. C AGC U AG UCAG (b) The only abnormal fragment is AUU, so the chain ends with this fragment. Since the abnormal fragment splits, we look for Eulerian trails or circuits whose U G final arc is labeled AUU. There are four chains: GUCGGGGUGAUU, GUGGGGUCGAUU, GGGGUGUCGAUU, GGGGUCGUGAUU. AU (c) The only abnormal fragment is AAG, so the chain ends with this. Since the abnormal fragment does not split, we look for Eulerian trails or circuits whose last U G vertex is AAG. There are eight chains: conditions are UGUCGCGAGCUAAG,UGUCGAGCGCUAAG, UGCGUCGAGCUAAG,UGAGCGUCGCUAAG, UCGUGCGAGCUAAG,UCGUGAGCGCUAAG, UCGCGUGAGCUAAG,UCGAGCGUGCUAAG. C AAG...
View Full Document
- Summer '10
- Graph Theory, Shortest path problem, Eulerian, Graph algorithms, abnormal fragment