A while ago, I wrote about Rob Spencer over at Scaled Innovation‘s implementation of the algorithm for detecting link communities. Today, I am happy to report on another exciting development for the alorithm. Alex Kalinka from the Tomancak lab at the Max Plank Institute (MPI-CBG) has written a great implementation in R, called linkcomm. It is now up on CRAN:
While everything is excellent, the graphics are particularly beautiful – much prettier than our own visualizations – check out the colored link dendrogram plot (from the CRAN website)
And the spatial network layout options are great as well; the various community visualizations are simple, elegant, and very pretty:
In addition, there are many neat features. For example, linkcomm allows you to visualize sub-communities by themselves. Alex has also published an Application Note in Bioinformatics about the implementation, so take a look if you’re interested:
We also link to the package from our link communities download page.