Abstract
Algorithms are designed, analyzed and implemented for the maximum clique enumeration (MCE) problem, which asks that we identify all maximum cliques in a finite, simple graph. MCE is closely related to two other well-known and widely-studied problems: the maximum clique optimization problem, which asks us to determine the size of a largest clique, and the maximal clique enumeration problem, which asks that we compile a listing of all maximal cliques. Naturally, these three problems are \(\cal NP\)-hard, given that they subsume the classic version of the \(\cal NP\)-complete clique decision problem.
MCE can be solved in principle with standard enumeration methods due to Bron, Kerbosch, Kose and others. Unfortunately, these techniques are ill-suited to graphs encountered in our applications. We must solve MCE on instances deeply seeded in data mining and computational biology, where high-throughput data capture often creates graphs of extreme size and density. MCE can also be solved in principle using more modern algorithms based in part on vertex cover and the theory of fixed-parameter tractability (FPT). While FPT is an improvement, these algorithms too can fail to scale sufficiently well as the sizes and densities of our datasets grow.
An extensive testbed of benchmark MCE instances is devised, based on applications in transcriptomic data analysis. Empirical testing reveals crucial but latent features of such high-throughput biological data. In turn, it is shown that these features distinguish real data from random data intended to reproduce salient topological features. In particular, with real data there tends to be an unusually high degree of maximum clique overlap. Armed with this knowledge, novel decomposition strategies are tuned to the data and coupled with the best FPT MCE implementations. It is demonstrated that the resultant run times are frequently reduced by several orders of magnitude, and that instances once prohibitively time-consuming to solve are now often brought into the domain of realistic feasibility.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Abu-Khzam, F.N., Langston, M.A., Shanbhag, P., Symons, C.T.: Scalable parallel algorithms for FPT problems. Algorithmica 45, 269–284 (2006)
Baldwin, N.E., Chesler, E.J., Kirov, S., Langston, M.A., Snoddy, J.R., Williams, R.W., Zhang, B.: Computational, integrative, and comparative methods for the elucidation of genetic coexpression networks. J. Biomed. Biotechnol. 2(2), 172–180 (2005)
Baldwin, N.E., Collins, R.L., Langston, M.A., Leuze, M.R., Symons, C.T., Voy, B.H.: High performance computational tools for motif discovery. In: Proceedings of 18th International Parallel and Distributed Processing Symposium (2004)
Barabási, A.-L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)
Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. Handbook of Combinatorial Optimization 4 (1999)
Borate, B.R., Chesler, E.J., Langston, M.A., Saxton, A.M., Voy, B.H.: Comparison of thresholding approaches for microarray gene co-expression matrices. BMC Research Notes 2 (2009)
Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM 16(9), 575–577 (1973)
Bul, S.R., Torsello, A., Pelillo, M.: A game-theoretic approach to partial clique enumeration. Image and Vision Computing 27(7), 911–922 (2009); 7th IAPR-TC15 Workshop on Graph-based Representations (GbR 2007)
Chesler, E.J., Langston, M.A.: Combinatorial genetic regulatory network analysis tools for high throughput transcriptomic data. In: RECOMB Satellite Workshop on Systems Biology and Regulatory Genomics (2005)
Chesler, E.J., Lu, L., Shou, S., Qu, Y., Gu, J., Wang, J., Hsu, H.C., Mountz, J.D., Baldwin, N.E., Langston, M.A., Hogenesch, J.B., Threadgill, D.W., Manly, K.F., Williams, R.W.: Complex trait analysis of gene expression uncovers polygenic and pleiotropic networks that modulate nervous system function. Nature Genetics 37, 233–242 (2005)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)
Eblen, J.D.: The Maximum Clique Problem: Algorithms, Applications, and Implementations. PhD thesis, University of Tennessee (2010), http://trace.tennessee.edu/utk_graddiss/793/
Eblen, J.D., Gerling, I.C., Saxton, A.M., Wu, J., Snoddy, J.R., Langston, M.A.: Graph algorithms for integrated biological analysis, with applications to type 1 diabetes data. In: Clustering Challenges in Biological Networks, pp. 207–222. World Scientific, Singapore (2008)
Erdős, P., Rényi, A.: Random graphs, pp. 17–61. Publication of the Mathematical Institute of the Hungarian Academy of Science (1960)
Fernau, H.: On parameterized enumeration. In: Proceedings of the 8th Annual International Conference on Computing and Combinatorics (2002)
Fernndez-Baca, D.: The perfect phylogeny problem. In: Cheng, X., Du, D.-Z. (eds.) Steiner Trees in Industry (2002)
Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman & Co., New York (1979)
Harley, E.R.: Comparison of clique-listing algorithms. In: Proceedings of the International Conference on Modeling, Simulation and Visualization Methods, pp. 433–438 (2004)
Kose, F., Weckwerth, W., Linke, T., Fiehn, O.: Visualizing plant metabolomic correlation networks using clique-metabolite matrices. Bioinformatics 17, 1198–1208 (2001)
Lai, L.C., Kosorukoff, A.L., Burke, P.V., Kwast, K.E.: Metabolic-state-dependent remodeling of the transcriptome in response to anoxia and subsequent reoxygenation in saccharomyces cerevisiae. Eukaryotic Cell 5(9), 1468–1489 (2006)
Li, L., Alderson, D., Doyle, J.C., Willinger, W.: Towards a theory of scale-free graphs: Definition, properties, and implications (extended version). Internet Mathematics (2005)
Malouf, R.: Maximal consistent subsets. Computational Linguistics 33, 153–160 (2007)
Moon, J.W., Moser, L.: On cliques in graphs. Israel Journal of Mathematics 3, 23–28 (1965)
Palla, G., Derényi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature 435, 814–818 (2005)
Perkins, A.D., Langston, M.A.: Threshold selection in gene co-expression networks using spectral graph theory techniques. BMC Bioinformatics 10 (2009)
Rogers, G.L., Perkins, A.D., Phillips, C.A., Eblen, J.D., Abu-Khzam, F.N., Langston, M.A.: Using out-of-core techniques to produce exact solutions to the maximum clique problem on extremely large graphs. In: ACS/IEEE International Conference on Computer Systems and Applications (AICCSA 2009), IEEE Computer Society, Los Alamitos (2009)
Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. Journal of Global Optimization 37, 95–111 (2007)
Tomitaa, E., Tanakaa, A., Takahashia, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science 363(1), 28–42 (2006)
Zhang, Y., Abu-Khzam, F.N., Baldwin, N.E., Chesler, E.J., Langston, M.A., Samatova, N.F.: Genome-scale computational approaches to memory-intensive applications in systems biology. In: Supercomputing (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Eblen, J.D., Phillips, C.A., Rogers, G.L., Langston, M.A. (2011). The Maximum Clique Enumeration Problem: Algorithms, Applications and Implementations. In: Chen, J., Wang, J., Zelikovsky, A. (eds) Bioinformatics Research and Applications. ISBRA 2011. Lecture Notes in Computer Science(), vol 6674. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21260-4_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-21260-4_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21259-8
Online ISBN: 978-3-642-21260-4
eBook Packages: Computer ScienceComputer Science (R0)