Download List

项目描述

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 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.

2010-07-20 21:51 Back to release list
10-201

内侧副韧带的聚类方案目前由于在相当快的内存管理代码优化。此外,它利用香草矩阵/向量乘法这比稀疏矩阵/矢量乘法更快。速度范围从收益略低于两倍到六倍基于图的大小和边缘密度而定。大速度增加,可能获得的尺寸图高达几百上千个节点。该图形查询程序已经收购了多家边的权重输出和汇总统计选项,和文件是固定的,更新。
标签: Major feature enhancements
The clustering program mcl is now considerably faster due to optimizations in the memory management code. Additionally, it utilises vanilla matrix/vector multiplication where this is faster than sparse matrix/vector multiplication. The speed gains range from slightly below twofold to sixfold depending on graph size and edge density. Large speed increases may be obtained for graphs of sizes up to several hundred thousands of nodes. The graph query program has acquired several edge weight output and summary statistics options, and documentation was fixed and updated.

Project Resources