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

2009-09-18 23:15 Back to release list
09-261

이 릴리스의 읽기와 mRNA 배열의 데이터 변환에 대한 지원을 향상시킵니다. MCL 옵션 입력 sparsify 그래프 분석 모드에서 분할되어 있고 지금은 CLM 프로그램 모드로 사용할 수있습니다 인수했다. 버그 MCL에서 소개 - 09-182 클러스터 해석 루틴에서 수정되었습니다. MCX 프로그램이 지금은 두 노드의 엉뚱함과 betweenness centrality 여러 컴퓨터 및 여러 스레드 이상 parallelized 계산할 수있습니다. 마이너 개선 프로그램의 전체 제품군에 걸쳐 만들어왔다.
Tags: Major
This release improves support for reading and transforming mRNA array
data. MCL has acquired an option to sparsify input graphs, and analysis
modes have been split off and are now available as a mode in the clm
program. A bug introduced in mcl-09-182 in the cluster interpretation
routines has been fixed. The mcx program can now compute both node
eccentricity and betweenness centrality parallelized over multiple
machines and multiple threads. Minor improvements have been made
throughout the entire suite of programs.

Project Resources