Research Article
Pin-Align: A New Dynamic Programming Approach to Align Protein-Protein Interaction Networks
| Input: Initial-similarity-bipartite-graph | | Output: Graph | | () Bipartite-graph | | () for all vertex do | | () Duplicate in | | () end for | | () Bipartite-graph = Maximum-Weight-Matching() | | () Merge duplicated vertices of in | | () Bipartite-graph | | () for all vertex do | | () Duplicate in | | () end for | | () Bipartite-graph = Maximum-Weight-Matching() | | () Merge duplicated vertices of in | | () Bipartite-graph | | () return |
|