Developer: Charalampos Moschopoulos
Supervisors:
Sofia Kossida
Spiros Likothanassis
The AHC Algorithm identifies protein complexes from pairwise protein – protein interaction datasets.
The algorithm is a hierarchical one and performs successive min –cuts until it identifies dense subgraphs. The stopping criterion of the AHC depends on the initial graph density and it is adjusted to each case accordingly. That means that when the input data forms a dense protein interaction network, the stopping criterion of the AHC is stricter and leads to the selection of more dense subgraphs as protein complexes candidates. Otherwise, if the input data forms a relatively sparse protein interaction network, its stopping criterion is resilient and allows the selection of less dense subgraphs as protein complexes candidates.
The complete source code can be downloaded here.
The datasets used in our experiments can be downloaded here.
The results
of the tested algorithms can be downloaded here.