1 Solve the Chinese Postman Problem Find the shortest closed

1) Solve the Chinese Postman Problem (Find the shortest closed walk using each edge at least once)

2) Find all possible RNA chains given the following decomposition
G-fragments: CACG UG CG AACG G
UC-fragments: GAAC GC GC GU C AC

Sole the Chinese Postman Proliem tind the shores chsed waik using eoch odee a leas et dused walk using eoch oles at leass all possible RNA chains given the following decomposi

Solution

1) Note that there are 4 odd vertices in the graph, D, E, G and H

6 pairings are possible and we need to find the miminum of them

DE = 2, DG = 1, DH = DG + GH = 4

EG = ED + DG = 3, EH = 4

GH = 4

Minimal odd pairing is DG.

Solution to problem is DG + Sum of all the edges in network + DG = 45 + 1 = 46