Using MCL to Extract Clusters from Networks
MCL is a general purpose cluster algorithm for both weighted and unweighted networks. The algorithm utilises network topology as well as edge weights, is highly scalable and has been applied in a wide variety of bioinformatic methods. In this chapter, we give protocols and case studies for clustering of networks derived from, respectively, protein sequence similarities and gene expression profile correlations.
Key wordsNetwork clustering Cluster analysis Protein sequence similarity Gene expression profiles
- 1.van Dongen S. (2000) A cluster algorithm for graphs. Tech. rep., National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam.Google Scholar
- 2.van Dongen S. (2000) Graph clustering by flow simulation. PhD thesis, University of Utrecht.Google Scholar
- 9.Samuel Lattimore B, van Dongen S, Crabbe MJ. (2005) GeneMCL in microarray analysis. Comput Biol Chem, 29:354–359.Google Scholar
- 19.d′Haeseleer P. (2005) How does gene expression clustering work? Nat Biotechnol, 23:1499–1501.Google Scholar
- 22.Gama-Castro S, et al. (2008) RegulonDB (version 6.0): gene regulation model of Escherichia coli K-12 beyond transcription, active (experimental) annotated promoters and Textpresso navigation. Nucleic Acids Res, 36:D120–124.Google Scholar
- 25.van Dongen S. (2000) Performance criteria for graph clustering and Markov cluster experiments. Tech. rep., National Research Institute for Mathematics and Computer Science in the Netherlands, Amsterdam. [http://www.cwi.nl/static/publications/reports/INS-2000.html].
- 27.Neidhardt FC, Curtiss R. (1996) Escherichia Coli and Salmonella: Cellular and Molecular Biology. 2nd ed. ASM Press, Washington. [Walker GC. The SOS response of Escherichia coli. 1400–1416].Google Scholar