Announcing folding graphs and linear notations

The current SVN version of plcc (rev. 940) can now compute folding graphs (FGs). FGs are the connected components of a protein graph. Since these graphs are connected, it is possible to compute linear string notations for them (think of SMILES for small molecules). These linear notations can be used to quickly search for certain substructures in the graphs.