An Improved Method for Completely Uncertain Biological Network Alignment

Algorithm 3

Extracting alignment results.

Input: Probabilistic graph , Probabilistic graph

Output: Maximum Weight Bipartite Matching

//initialize Matrix

(1)

(2)  = matrix () of weights on the edges of with partite sets and .

(3)

(4) set of tight edges

(5) max cardinality matching for graph

//repeat find a perfect matching

(6) while is not a perfect matching do

(7) let

(8) let be such that

(9) let

(10) 

(11) 

(12)  update

(13) end while

(14) return