Download List

Project Description

MCL-edge is an integrated command-line driven workbench for large scale network analysis. It includes programs for the computation of shortest paths, diameter, clustering coefficient, betweenness centrality, and network shuffles. A module for loading and analyzing gene expression data as a network is provided. The MCL algorithm is a fast and highly scalable cluster algorithm for networks based on stochastic flow. The flow process employed by the algorithm is mathematically sound and intrinsically tied to cluster structure, which is revealed as the imprint left by the process. The threaded implementation has handled networks with millions of nodes within hours and is widely used in the fields of bioinformatics, graph clustering, and network analysis.

System Requirements

System requirement is not defined
Information regarding Project Releases and Project Resources. Note that the information here is a quote from Freecode.com page, and the downloads themselves may not be hosted on OSDN.

2008-06-05 23:05 Back to release list
08-157

The mcl suite is moving towards a wider focus on
general purpose large scale graph analysis, with
the emphasis, besides clustering, on basic graph
and clustering measures and transformations. The
program mcxarray can now transform tabular gene
expression data into graph input. The clm utility
computes clustering coefficients, diameter and
eccentricity, and betweenness centrality. Many
fixes and improvements were made throughout.
Tags: Major feature enhancements

Project Resources