[go: up one dir, main page]

Menu

[r820]: / trunk / Gato / HMMXML.py  Maximize  Restore  History

Download this file

414 lines (316 with data), 13.1 kB

  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
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
#!/usr/bin/env python
################################################################################
#
# This file is part of Gato (Graph Algorithm Toolbox)
#
# file: HMMXML.py
# author: Alexander Schliep (alexander@schlieplab.org)
#
# Copyright (C) 2016-2020 Alexander Schliep and
# Copyright (C) 1998-2015 Alexander Schliep, Winfried Hochstaettler and
# Copyright (C) 1998-2001 ZAIK/ZPR, Universitaet zu Koeln
#
# Contact: alexander@schlieplab.org
#
#
# This library is free software; you can redistribute it and/or
# modify it under the terms of the GNU Library General Public
# License as published by the Free Software Foundation; either
# version 2 of the License, or (at your option) any later version.
#
# This library is distributed in the hope that it will be useful,
# but WITHOUT ANY WARRANTY; without even the implied warranty of
# MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
# Library General Public License for more details.
#
# You should have received a copy of the GNU Library General Public
# License along with this library; if not, write to the Free
# Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#
#
#
# This file is version $Revision$
# from $Date$
# last change by $Author$.
#
#################################################################################
#
#
#
#
#- Utility --------------------------------------------------------------------
from sys import *
from xml.dom.minidom import *
import copy
import string
import logging
def printDict(d):
for k in d.keys():
print k, d[k]
def getText(nodelist):
rc = ""
for node in nodelist:
if node.nodeType == node.TEXT_NODE:
rc = rc + node.data
return rc
def copyAttributes(XMLNode, object):
for i in xrange(0,XMLNode.attributes.length):
attrName = XMLNode.attributes.item(i).name
attrValue = XMLNode.attributes.item(i).value
object.__dict__[attrName] = attrValue
def attributesDict(XMLNode):
retVal = {}
for i in xrange(0,XMLNode.attributes.length):
attrName = XMLNode.attributes.item(i).name
attrValue = XMLNode.attributes.item(i).value
retVal[attrName] = attrValue
return retVal
#- GraphML ---------------------------------------------------------------------
class DataFactory:
# Maps strings to callable objects
def __init__(self):
self.factories = {}
self.factories['string'] = lambda s: s
self.factories['int'] = int
self.factories['float'] = float
self.factories['intArray'] = lambda s, f=self.arrayFromCSV: f(s, int)
self.factories['floatArray'] = lambda s, f=self.arrayFromCSV: f(s, float)
self.factories['DiscreteProbDist'] = self.factories['floatArray']
self.factories['HigherDiscreteProbDist'] = self.factories['floatArray']
def __call__(self, type, stringArg):
return self.factories[type](stringArg)
def Types(self):
return self.factories.keys()
def arrayFromCSV(self, s, type):
retVal = []
logging.debug("DataFactory.arrayFromCSV(%s)" % str(s))
items = string.split(s,',')
for i in items:
retVal.append(type(i))
return retVal
class GraphML:
def __init__(self):
# Prototypes for which we can set default values of instance variables
self.graphProto = Graph()
self.nodeProto = Node()
self.edgeProto = Edge()
# Key Tags
self.desc = {} # Human readable descriptions
self.domain = {} # To what objects do they apply
self.type = {} # Their Type
self.graph = None
self.dataFactory = DataFactory()
# Graph, Edge, Node factories
def NewGraph(self):
g = copy.deepcopy(self.graphProto)
return g
def NewEdge(self,source,target):
e = copy.deepcopy(self.edgeProto)
e.source = source
e.target = target
return e
def NewNode(self,id):
n = copy.deepcopy(self.nodeProto)
n.id = id
return n
def AddEdge(self,source,target):
e = self.NewEdge(source,target)
self.graph.edges.append(e)
return e
def AddNode(self,id):
n = self.NewNode(id)
self.graph.nodes.append(n)
return n
# XML Parsing
def handleGraphML(self, graphML):
keys = graphML.getElementsByTagName("key")
for key in keys:
self.handleKey(key)
XMLGraph = graphML.getElementsByTagName("graph")
self.handleGraph(XMLGraph[0]) # There should only be one graph per graphml
HMMAlphabet = graphML.getElementsByTagName("hmm:alphabet")
if len(HMMAlphabet) > 0: # We do have an HMM
self.handleHMMAlphabet(HMMAlphabet[0])# There should only be one HMMAlphabet per graphml
def handleKey(self, key):
try: # valid values: all, graph, node, edge
keyDomain = key.attributes['for'].nodeValue
except KeyError:
keyDomain = 'all'
try:
keyType = key.attributes['gd:type'].nodeValue
except KeyError:
keyType = 'string'
# ID required
keyName = key.attributes['id'].nodeValue
descNodes = key.getElementsByTagName("desc")
if len(descNodes) > 0:
keyDesc = descNodes[0].firstChild.nodeValue # There should be only one desc
else:
keyDesc = None
#print keyName, keyDesc, keyType, keyDomain
self.desc[keyName] = keyDesc
self.type[keyName] = keyType
self.domain[keyName] = keyDomain
keyValue = None # For simple objects
# Initialize complex objects
if not keyType in self.dataFactory.Types():
keyValue = Empty()
partials = key.getElementsByTagName("*")
for partial in partials:
copyAttributes(partial, keyValue)
# Add attributes to prototypes
if keyDomain == 'all' or keyDomain == 'node':
self.nodeProto.__dict__[keyName] = keyValue
if keyDomain == 'all' or keyDomain == 'edge':
self.edgeProto.__dict__[keyName] = keyValue
if keyDomain == 'graph':
self.graphProto.__dict__[keyName] = keyValue
def handleGraph(self, XMLGraph):
self.graph = self.NewGraph()
nodes = XMLGraph.getElementsByTagName("node")
for node in nodes:
self.handleNode(node)
edges = XMLGraph.getElementsByTagName("edge")
for edge in edges:
self.handleEdge(edge)
def handleHMMAlphabet(self, XMLNode):
if XMLNode.getAttribute("hmm:type") == "discrete":
self.hmmAlphabet = DiscreteAlphabet()
self.hmmAlphabet.low = int(XMLNode.getAttribute("hmm:low"))
self.hmmAlphabet.high = int(XMLNode.getAttribute("hmm:high"))
symbols = XMLNode.getElementsByTagName("symbol") # One map!
for symbol in symbols:
symbolCode = int(symbol.getAttribute("code"))
symbolRep = symbol.firstChild.nodeValue
self.hmmAlphabet.map[symbolCode] = symbolRep
else:
logging.error("GraphML::handleHMMAlphabet does not handle alphabet type %s yet" % XMLNode.getAttribute("hmm:type"))
# print self.hmmAlphabet.__dict__
def handleXMLNodeData(self, object, XMLNode):
datas = XMLNode.getElementsByTagName("data")
for data in datas:
dataKey = data.attributes['key'].nodeValue
dataValue = data.firstChild.nodeValue
#print object, object.__dict__,dataKey, dataValue
if dataValue != None:
object.__dict__[dataKey] = self.dataFactory(self.type[dataKey], dataValue)
else:
#copyAttributes(data.firstChild,object.__dict__[dataKey])
partials = data.getElementsByTagName("*")
for partial in partials:
copyAttributes(partial, object.__dict__[dataKey])
def handleNode(self, node):
nodeID = node.attributes['id'].nodeValue
n = self.AddNode(nodeID)
self.handleXMLNodeData(n, node)
def handleEdge(self, edge):
edgeSource = edge.attributes['source'].nodeValue
edgeTarget = edge.attributes['target'].nodeValue
e = self.AddEdge(edgeSource, edgeTarget)
self.handleXMLNodeData(e, edge)
def __str__(self):
r = "GraphML\n"
r = r + " #key\tdescription\n"
for k in self.desc.keys():
r = r + " %s\t%s\n" % (k,self.desc[k])
r = r + " #Nodes -------------------------\n"
r = r + " id "
for k in self.desc.keys():
if self.domain[k] == 'all' or self.domain[k] == 'node':
r = r + " %s " % k
r = r + "\n"
for n in self.graph.nodes:
r = r + " %s " % n.id
for k in self.desc.keys():
if self.domain[k] == 'all' or self.domain[k] == 'node':
r = r + " %s " % n.__dict__[k]
r = r + "\n"
r = r + " #Edges -------------------------\n "
for k in self.desc.keys():
if self.domain[k] == 'all' or self.domain[k] == 'edge':
r = r + " %s " % k
r = r + "\n"
for e in self.graph.edges:
r = r + " (%s,%s) " % (e.source, e.target)
for k in self.desc.keys():
if self.domain[k] == 'all' or self.domain[k] == 'edge':
r = r + " %s " % e.__dict__[k]
r = r + "\n"
return r
class Graph:
def __init__(self):
self.nodes = []
self.edges = []
self.id = None
class Node:
def __init__(self):
self.id = None
class Edge:
def __init__(self):
self.id = None
self.source = None
self.target = None
class Empty:
def __init__(self, **args):
for k in args.keys():
self.__dict__[k] = args[k]
def __str__(self):
r = "{"
for k in self.__dict__.keys():
r = r + "%s:%s," % (k, self.__dict__[k])
r = r + "}"
return r
class DiscreteAlphabet:
def __init__(self):
self.map = {}
self.low = 0
self.high = 0
def __getitem__(self, i):
return self.map[i]
def WriteData(doc, e, object, keys):
#print doc, e, object, keys
for k in keys:
elem = doc.createElement("data")
elem.setAttribute('key', k)
contents = doc.createTextNode("%s" % object.__dict__[k])
elem.appendChild(contents)
e.appendChild(elem)
def WriteXML(gml):
doc = Document()
graphml = doc.createElement("graphml")
doc.appendChild(graphml)
node_keys = []
edge_keys = []
for k in gml.desc.keys():
elem = doc.createElement("key")
elem.setAttribute('id', k)
if gml.domain[k] != None:
elem.setAttribute('for', gml.domain[k] )
elem.setAttribute('gd:type', gml.type[k])
graphml.appendChild(elem)
if gml.domain[k] == 'node' or gml.domain[k] == 'all':
node_keys.append(k)
if gml.domain[k] == 'edge' or gml.domain[k] == 'all':
edge_keys.append(k)
graphelem = doc.createElement("graph")
graphml.appendChild(graphelem)
for n in gml.graph.nodes:
elem = doc.createElement("node")
elem.setAttribute('id', n.id)
WriteData(doc,elem,n,node_keys)
graphelem.appendChild(elem)
for e in gml.graph.edges:
elem = doc.createElement("edge")
elem.setAttribute('source', e.source)
elem.setAttribute('target', e.target)
WriteData(doc,elem,e,edge_keys)
graphelem.appendChild(elem)
#print doc.toprettyxml()
if __name__ == '__main__':
dom = parse(argv[1])
assert dom.documentElement.tagName == "graphml"
gml = GraphML()
gml.handleGraphML(dom)
#print gml
WriteXML(gml)
dom.unlink()