Exemplo n.º 1
0
 def __call__(self, reduced_parameter_index):
   searchgraph = self.GeneQuery(reduced_parameter_index)
   searchgraph.matching_label = lambda v : self.matching_label(searchgraph.mgi(v))
   alignment_graph = AlignmentGraph(searchgraph, self.patterngraph, self.matching_relation)
   root_vertex = (0,0)
   leaf_vertex = (len(searchgraph.vertices)-1, max(self.patterngraph.vertices))
   return alignment_graph.numberOfPaths(root_vertex, leaf_vertex) > 0
Exemplo n.º 2
0
 def __call__(self, reduced_parameter_index):
     searchgraph = self.GeneQuery(reduced_parameter_index)
     searchgraph.matching_label = lambda v: self.matching_label(
         searchgraph.mgi(v))
     alignment_graph = AlignmentGraph(searchgraph, self.patterngraph,
                                      self.matching_relation)
     root_vertex = (0, 0)
     leaf_vertex = (len(searchgraph.vertices) - 1, 4)
     return alignment_graph.numberOfPaths(root_vertex, leaf_vertex) > 0
Exemplo n.º 3
0
 def resettable_bistability(self, reduced_parameter_index):
   searchgraph = self.GeneQuery(reduced_parameter_index)
   searchgraph.matching_label = lambda v : self.matching_label_reset_bistab(searchgraph.mgi(v))
   alignment_graph = AlignmentGraph(searchgraph, self.patterngraph_reset_bistab, self.matching_relation)
   root_vertex = (0,0)
   for n in range(1,len(searchgraph.vertices)):
     if self.B(searchgraph.mgi(n)):
       leaf_vertex = (n,max(self.patterngraph_reset_bistab.vertices)) 
       if alignment_graph.numberOfPaths(root_vertex, leaf_vertex) > 0:
         return True
   return False