Research Article
An Improved Method for Completely Uncertain Biological Network Alignment
Algorithm 1
The algorithm of computing
.
Input: Probabilistic graph , | Probabilistic graph | Output: | // Construct PGF of | (1) for all do: | (2) construct PGF of | (3) construct PGF of | (4) end for | // Compute every entry in | (5) for all do: | // Compute using (10) | (6) | (7) for all do: | (8) | (9) end for | (10) | (11) for all do: | (12) | (13) end for | (14) | //Compute using (12) | (15) | (16) for all do: | //Compute PGF of and | (17) | (18) | //Use PGF of and | //to get conditional Probabilistic distribution | //according to Theorem 3 | (19) | (20) | (21) end for | (22) | (23) end for |
|