C++ description for IPCA 
This file are free only for academic users.
Author: Min Li


NAME
    IPCA - An Algorithm for Identification of Protein Complexes

SYNOPSIS
    IPCA -G[graph_filename] -S[Size] -P[Shortest Path Length]  -T[Tin] -O[Clustering_Results_filename]

DESCRIPTION
    The IPCA algorithm takes a simple graph as input and clusters it, writing the final clustering to Clustering_Results_filename.  There are several user-input parameters that affect the algorithm's behaviour.

OPTIONS
   
    -G[graph_filename]	
    IPCA reads the input graph from a filename, given as graph_filename. This file must have a very strict format.  Format of the input file, a small example file is provided. (example.txt)
    e.g., node1	  node2

    -S[Size] 
    The complexes whose sizes are smaller than "Size" are not writen to the output file.

    -P[Shortest Path Length] 
    Set the shortest path between proteins in the complex to be "Shortest path length". Here, 2 is the best choice. 

    -T[Threshold] 
    Set the parameter "Tin" to "Threshold".  "Tin" is larger than 0 and smaller than 1. 

    -O[Clustering_Results_filename]
    Write the final clustering to a given filename. 

 EXAMPLE
    IPCA -Gexample.txt -S5 -P2 -T0.6 -Oout.txt