Email updates    Open Access Proceedings  The maximum clique
enumeration problem: algorithms, applications, and
implementations  John D Eblen1, Charles A Phillips2, Gary L
Rogers2 and Michael A Langston2*  Author Affiliations   2
Department of Electrical Engineering and Computer Science,
University of Tennessee, Knoxville, TN 37996-3450, USA  For all
author emails, please log on.  BMC Bioinformatics 2012, 13(Suppl
10):S5  doi:10.1186/1471-2105-13-S10-S5   Published:25 June 2012
© 2012 Eblen et al.; licensee BioMed Central Ltd.      An
extensive testbed of benchmark graphs are created using publicly
available transcriptomic datasets from the Gene Expression
Omnibus (GEO). 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