NAME
BioGraph::Clustering
SYNOPSIS
use BioGraph::Clustering;
DESCRIPTION
Package for manipulate graphs represented as well as adjacent matrix or adjacent list. Library for clustering graphs.
AVAILABLE FUNCTIONS
This is the list of the differents functions implemented in this library.
- ZD_kernel
-
Compute the kernels of the graph
SYNOPSIS %K=ZD_kernel(representation, ref_density, graph)
PARAMETERS
- representation
-
the type of representation choosen : 1 = adjacent matrix, and 2 = adjacent list
- ref_density
-
reference to the table of densities
- graph
-
the hash table of the graph
OUTPUT The kernels (view as clusters) of the graph computed according to the definition of T. Colombo, A. Guenoche and Y. Quentin, "Research of density areas in a graph - Application to orthologous genes", Proceedings of the Fourth International Conference on Knowledge Discovery and Discrete Mathematics (2003).
- ZD_extension
-
Compute the clusters of the graph
SYNOPSIS %C=ZD_extension(representation, ref_density, ref_kernel, graph)
PARAMETERS
- representation
-
the type of representation choosen : 1 = adjacent matrix, and 2 = adjacent list
- ref_density
-
reference to the table of densities
- ref_kernel
-
reference to the hash table of kernels
- graph
-
the hash table of the graph
OUTPUT The clusters of the graph computed according to the definition of T. Colombo, A. Guenoche and Y. Quentin, "Research of density areas in a graph - Application to orthologous genes", Proceedings of the Fourth International Conference on Knowledge Discovery and Discrete Mathematics (2003).
AUTHOR AND COPYRIGHT
BioGraph::FileAccess is Copyright (C) 2004, Tristan Colombo
CNRS - LCB, 31 chemin Joseph Aiguier
13009 Marseille
France
Email: tristan.colombo@ibsm.cnrs-mrs.fr
All rights reserved.
You may distribute this package under the terms of the GNU
General Public License.