{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:27:45Z","timestamp":1725582465807},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212598"},{"type":"electronic","value":"9783642212604"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21260-4_30","type":"book-chapter","created":{"date-parts":[[2011,4,29]],"date-time":"2011-04-29T04:26:59Z","timestamp":1304051219000},"page":"306-319","source":"Crossref","is-referenced-by-count":3,"title":["The Maximum Clique Enumeration Problem: Algorithms, Applications and Implementations"],"prefix":"10.1007","author":[{"given":"John D.","family":"Eblen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles A.","family":"Phillips","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gary L.","family":"Rogers","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael A.","family":"Langston","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/s00453-006-1214-1","volume":"45","author":"F.N. Abu-Khzam","year":"2006","unstructured":"Abu-Khzam, F.N., Langston, M.A., Shanbhag, P., Symons, C.T.: Scalable parallel algorithms for FPT problems. Algorithmica\u00a045, 269\u2013284 (2006)","journal-title":"Algorithmica"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1155\/JBB.2005.172","volume":"2","author":"N.E. Baldwin","year":"2005","unstructured":"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.\u00a02(2), 172\u2013180 (2005)","journal-title":"J. Biomed. Biotechnol."},{"key":"30_CR3","unstructured":"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)"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1126\/science.286.5439.509","volume":"286","author":"A.-L. Barab\u00e1si","year":"1999","unstructured":"Barab\u00e1si, A.-L., Albert, R.: Emergence of scaling in random networks. Science\u00a0286, 509\u2013512 (1999)","journal-title":"Science"},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. Handbook of Combinatorial Optimization\u00a04 (1999)","DOI":"10.1007\/978-1-4757-3023-4_1"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"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\u00a02 (2009)","DOI":"10.1186\/1756-0500-2-240"},{"issue":"9","key":"30_CR7","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1145\/362342.362367","volume":"16","author":"C. Bron","year":"1973","unstructured":"Bron, C., Kerbosch, J.: Algorithm 457: finding all cliques of an undirected graph. Commun. ACM\u00a016(9), 575\u2013577 (1973)","journal-title":"Commun. ACM"},{"issue":"7","key":"30_CR8","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1016\/j.imavis.2008.10.003","volume":"27","author":"S.R. Bul","year":"2009","unstructured":"Bul, S.R., Torsello, A., Pelillo, M.: A game-theoretic approach to partial clique enumeration. Image and Vision Computing\u00a027(7), 911\u2013922 (2009); 7th IAPR-TC15 Workshop on Graph-based Representations (GbR 2007)","journal-title":"Image and Vision Computing"},{"key":"30_CR9","unstructured":"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)"},{"key":"30_CR10","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1038\/ng1518","volume":"37","author":"E.J. Chesler","year":"2005","unstructured":"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\u00a037, 233\u2013242 (2005)","journal-title":"Nature Genetics"},{"key":"30_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, New York (1999)"},{"key":"30_CR12","unstructured":"Eblen, J.D.: The Maximum Clique Problem: Algorithms, Applications, and Implementations. PhD thesis, University of Tennessee (2010), \n                  \n                    http:\/\/trace.tennessee.edu\/utk_graddiss\/793\/"},{"key":"30_CR13","first-page":"207","volume-title":"Clustering Challenges in Biological Networks","author":"J.D. Eblen","year":"2008","unstructured":"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\u2013222. World Scientific, Singapore (2008)"},{"key":"30_CR14","unstructured":"Erd\u0151s, P., R\u00e9nyi, A.: Random graphs, pp. 17\u201361. Publication of the Mathematical Institute of the Hungarian Academy of Science (1960)"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"Fernau, H.: On parameterized enumeration. In: Proceedings of the 8th Annual International Conference on Computing and Combinatorics (2002)","DOI":"10.1007\/3-540-45655-4_60"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"Fernndez-Baca, D.: The perfect phylogeny problem. In: Cheng, X., Du, D.-Z. (eds.) Steiner Trees in Industry (2002)","DOI":"10.1007\/978-1-4613-0255-1_6"},{"key":"30_CR17","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. WH Freeman & Co., New York (1979)"},{"key":"30_CR18","unstructured":"Harley, E.R.: Comparison of clique-listing algorithms. In: Proceedings of the International Conference on Modeling, Simulation and Visualization Methods, pp. 433\u2013438 (2004)"},{"key":"30_CR19","doi-asserted-by":"publisher","first-page":"1198","DOI":"10.1093\/bioinformatics\/17.12.1198","volume":"17","author":"F. Kose","year":"2001","unstructured":"Kose, F., Weckwerth, W., Linke, T., Fiehn, O.: Visualizing plant metabolomic correlation networks using clique-metabolite matrices. Bioinformatics\u00a017, 1198\u20131208 (2001)","journal-title":"Bioinformatics"},{"issue":"9","key":"30_CR20","doi-asserted-by":"publisher","first-page":"1468","DOI":"10.1128\/EC.00107-06","volume":"5","author":"L.C. Lai","year":"2006","unstructured":"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\u00a05(9), 1468\u20131489 (2006)","journal-title":"Eukaryotic Cell"},{"key":"30_CR21","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1080\/15427951.2005.10129111"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1162\/coli.2007.33.2.153","volume":"33","author":"R. Malouf","year":"2007","unstructured":"Malouf, R.: Maximal consistent subsets. Computational Linguistics\u00a033, 153\u2013160 (2007)","journal-title":"Computational Linguistics"},{"key":"30_CR23","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF02760024","volume":"3","author":"J.W. Moon","year":"1965","unstructured":"Moon, J.W., Moser, L.: On cliques in graphs. Israel Journal of Mathematics\u00a03, 23\u201328 (1965)","journal-title":"Israel Journal of Mathematics"},{"key":"30_CR24","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1038\/nature03607","volume":"435","author":"G. Palla","year":"2005","unstructured":"Palla, G., Der\u00e9nyi, I., Farkas, I., Vicsek, T.: Uncovering the overlapping community structure of complex networks in nature and society. Nature\u00a0435, 814\u2013818 (2005)","journal-title":"Nature"},{"key":"30_CR25","doi-asserted-by":"crossref","unstructured":"Perkins, A.D., Langston, M.A.: Threshold selection in gene co-expression networks using spectral graph theory techniques. BMC Bioinformatics\u00a010 (2009)","DOI":"10.1186\/1471-2105-10-S11-S4"},{"key":"30_CR26","volume-title":"ACS\/IEEE International Conference on Computer Systems and Applications (AICCSA 2009)","author":"G.L. Rogers","year":"2009","unstructured":"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)"},{"key":"30_CR27","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s10898-006-9039-7","volume":"37","author":"E. Tomita","year":"2007","unstructured":"Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. Journal of Global Optimization\u00a037, 95\u2013111 (2007)","journal-title":"Journal of Global Optimization"},{"issue":"1","key":"30_CR28","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1016\/j.tcs.2006.06.015","volume":"363","author":"E. Tomitaa","year":"2006","unstructured":"Tomitaa, E., Tanakaa, A., Takahashia, H.: The worst-case time complexity for generating all maximal cliques and computational experiments. Theoretical Computer Science\u00a0363(1), 28\u201342 (2006)","journal-title":"Theoretical Computer Science"},{"key":"30_CR29","unstructured":"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)"}],"container-title":["Lecture Notes in Computer Science","Bioinformatics Research and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21260-4_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T05:31:23Z","timestamp":1558589483000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21260-4_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212598","9783642212604"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21260-4_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}