Biorithm
1.1
|
Public Member Functions | |
MyOneVersusAllLocalGainAlgo (MyGainGraph &g, MyAnnotations &a, MyGainParams &p, Reporter &r, GeneOntology *go=NULL) | |
MyGainTriState | computeState (MyNode &node) |
virtual string | getName () |
virtual void | run (const MyNodeIdList &nodesToAnnotate) |
of MyOneVersusAllGainAlgo. This algorithm implements the common "guilt-by-association" approach for predicting gene function. The state of a node is the signed weighted average of the states of the neighbours of that node.
MyGainTriState MyOneVersusAllLocalGainAlgo::computeState | ( | MyNode & | node | ) | [virtual] |
This method should be a member of this class since the method needs access to the states of the nodes (stored in subclasses of the class).
Reimplemented from MyOneVersusAllGainAlgo.
virtual string MyOneVersusAllLocalGainAlgo::getName | ( | ) | [inline, virtual] |
Return the name of the algorithm.
Reimplemented from MyOneVersusAllGainAlgo.
void MyOneVersusAllLocalGainAlgo::run | ( | const MyNodeIdList & | nodesToAnnotate | ) | [virtual] |
This method repeatedly iterates over all the nodes in nodesToAnnotate in the order in which they occur in nodesToAnnotate. It computes the state of each node in this list. The method iterates until the states converge.
Reimplemented from MyOneVersusAllGainAlgo.