VieClus

VieClus applies a memetic algorithm to perform graph clustering for analysis of biological networks, including protein-protein interaction networks.

Key Features:

• Memetic Algorithm: Combines evolutionary strategies with local search heuristics to explore and exploit clustering solution spaces.
• Natural Recombine Operators: Leverages ensemble clusterings and multi-level techniques to recombine diverse clustering results.
• Scalable Communication Protocol: Facilitates efficient computation across distributed systems to scale processing of large graphs.
• Performance and Efficiency: Reproduces and often improves benchmark results from the 10th DIMACS Implementation Challenge, achieving superior results on many small instances in less than a minute.

Scientific Applications:

• Protein-protein interaction network analysis: Clusters PPI networks to identify functional groups and infer biological processes.
• Large-scale biological graph analysis: Enables rapid and accurate clustering of large graph-structured biological datasets for downstream interpretation.

Methodology:

Uses a memetic algorithm that combines evolutionary strategies and local search heuristics; applies natural recombine operators based on ensemble clusterings and multi-level techniques; employs a scalable communication protocol for distributed systems; validated against the 10th DIMACS Implementation Challenge.