mcl-algorithm Changelog

What's new in mcl-algorithm 10-201

Jul 20, 2010
  • 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.

New in mcl-algorithm 09-261 (Sep 18, 2009)

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