def getSortedGaps(self):
"""
Returns dictionary of gaps partitioned by scaffold and sorted by
location
"""
ret = defaultdict(list)
for key in self:
if self[key].start == 'na':
continue
#print str(self[key])
#print ret[self[key].scaffold]
bisect.insort(ret[self[key].scaffoldId], self[key])
#print ret[self[key].scaffold]
#raw_input()
return dict(ret)
评论列表
文章目录