forked from xuwd11/Coursera-Bioinformatics
-
Notifications
You must be signed in to change notification settings - Fork 0
/
35_02_ColoredEdges.py
209 lines (177 loc) · 6.32 KB
/
35_02_ColoredEdges.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
# python3
import sys
import numpy as np
import copy
'''
1. Implement ColoredEdges.
Input: A genome P.
Output: The collection of colored edges in the genome graph of P in the form (x, y).
Sample Input:
(+1 -2 -3)(+4 +5 -6)
Sample Output:
(2, 4), (3, 6), (5, 1), (8, 9), (10, 12), (11, 7)
ColoredEdges(P)
Edges ← an empty set
for each chromosome Chromosome in P
Nodes ← ChromosomeToCycle(Chromosome)
for j ← 1 to |Chromosome|
add the edge (Nodes2j, Nodes2j +1) to Edges
return Edges
2. Implement GraphToGenome.
Input: The colored edges ColoredEdges of a genome graph.
Output: The genome P corresponding to this genome graph.
Sample Input:
(2, 4), (3, 6), (5, 1), (7, 9), (10, 12), (11, 8)
Sample Output:
(+1 -2 -3)(-4 +5 -6)
GraphToGenome(GenomeGraph)
P ← an empty set of chromosomes
for each cycle Nodes in GenomeGraph
Nodes ← sequence of nodes in this cycle (starting from node 1)
Chromosome ← CycleToChromosome(Nodes)
add Chromosome to P
return P
'''
class ColoredEdges:
def __init__(self):
'''
self._inputGenome()
edges = self.coloredEdges(self.genome)
print(str(edges)[1:-1])
'''
#self._inputGraph()
self.readGraphFromFile()
genome = self.graphToGenome(self.edges)
self.printGenome(genome)
def _inputChromosome(self):
data = sys.stdin.read().strip().split()
self.chromosome = [int(data[0][1:])] + [int(e) for e in data[1:-1]] + [int(data[-1][:-1])]
def _inputNodes(self):
data = sys.stdin.read().strip().split()
self.nodes = [int(data[0][1:])] + [int(e) for e in data[1:-1]] + [int(data[-1][:-1])]
def _inputGenome(self):
data = sys.stdin.read().strip().split(')(')
genome = []
for d in data:
d = d.split()
genome.append([int(d[0][1:] if '('==d[0][0] else d[0])] + [int(e) for e in d[1:-1]] +\
[int(d[-1][:-1] if ')'==d[-1][-1] else d[-1])])
self.genome = genome
def _inputGraph(self):
data = sys.stdin.read().strip().split('), (')
edges = set()
for d in data:
d = d.split(',')
edges.add((int(d[0][1:] if '('==d[0][0] else d[0]), int(d[1][:-1] if ')'==d[1][-1] else d[1])))
self.edges = edges
def readGraphFromFile(self):
f = open('input.txt', 'r')
data = []
for line in f:
data.append(line.strip())
data = data[0].split('), (')
edges = set()
for d in data:
d = d.split(',')
edges.add((int(d[0][1:] if '('==d[0][0] else d[0]), int(d[1][:-1] if ')'==d[1][-1] else d[1])))
self.edges = edges
def readFile(self):
f = open('input.txt', 'r')
data = []
for line in f:
data.append(line.strip())
data = data[0].split()
self.chromosome = [int(data[0][1:])] + [int(e) for e in data[1:-1]] + [int(data[-1][:-1])]
def chromosomeToCycle(self, chromosome):
l = len(chromosome)
nodes = [0]*(2*l)
for j in range(l):
i = chromosome[j]
if i > 0:
nodes[2*j] = 2*i-1
nodes[2*j+1] = 2*i
else:
nodes[2*j] = -2*i
nodes[2*j+1] = -2*i-1
return nodes
def cycleToChromosome(self, nodes):
l = len(nodes) // 2
chromosome = [0]*l
for j in range(l):
if nodes[2*j] < nodes[2*j+1]:
chromosome[j] = nodes[2*j+1]//2
else:
chromosome[j] = -nodes[2*j]//2
return chromosome
def printChromosome(self, chromosome):
print('('+' '.join(['+'+str(e) if e>0 else str(e) for e in chromosome])+')')
def coloredEdges(self, genome):
edges = set()
for chromosome in genome:
nodes = self.chromosomeToCycle(chromosome)
nodes.append(nodes[0])
for j in range(len(chromosome)):
edges.add((nodes[2*j+1], nodes[2*j+2]))
return edges
def graphToGenome(self, edges):
parent = dict()
rank = dict()
for e in edges:
parent[e[0]] = e[0]
parent[e[1]] = e[1]
rank[e[0]] = 0
rank[e[1]] = 0
def findParent(i):
if i != parent[i]:
parent[i] = findParent(parent[i])
return parent[i]
def union(i, j):
i_id = findParent(i)
j_id = findParent(j)
if i_id == j_id:
return
if rank[i_id] > rank[j_id]:
parent[j_id] = i_id
else:
parent[i_id] = j_id
if rank[i_id] == rank[j_id]:
rank[j_id] += 1
def unionEdges(edge):
union(edge[0], edge[1])
if 1 == edge[0] % 2:
union(edge[0], edge[0]+1)
else:
union(edge[0], edge[0]-1)
if 1 == edge[1] % 2:
union(edge[1], edge[1]+1)
else:
union(edge[1], edge[1]-1)
for e in edges:
unionEdges(e)
nodesID = dict()
nodesSets = set()
for e in edges:
id = findParent(e[0])
nodesID[e[0]] = id
nodesID[e[1]] = id
nodesSets.add(id)
nodes = dict()
sortedEdges = sorted(edges)
for e in sortedEdges:
id = nodesID[e[0]]
if not id in nodes:
nodes[id] = []
nodes[id].append(e[0])
nodes[id].append(e[1])
genome = dict()
for id, n in nodes.items():
genome[id] = self.cycleToChromosome([n[-1]]+n[:-1])
genome = sorted(genome.values(), key = lambda x:abs(x[0]))
return genome
def printGenome(self, genome):
result = ''
for chromosome in genome:
result += '('+' '.join(['+'+str(e) if e>0 else str(e) for e in chromosome])+')'
print(result)
if __name__ == "__main__":
ColoredEdges()