Exact parallel maximum clique algorithm for general and protein graphs

Journal of Chemical Information and Modeling

Volumn 53, Issue 9, 2013, Pages 2217-2228

  Depolli, Matjaž ^a   Konc, Janez ^b   Rozman, Kati ^b   Trobec, Roman ^a   Janežič, Dušanka ^b,c  

^a JO EF STEFAN INSTITUTE   (Slovenia)

^b NATIONAL INSTITUTE OF CHEMISTRY   (Slovenia)

^c UNIVERSITY OF PRIMORSKA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH AND BOUND METHOD; GRAPHIC METHODS; PROTEINS; TREES (MATHEMATICS);

BRANCH AND BOUND SEARCH; CONNECTED SUBGRAPH; ORDERS OF MAGNITUDE; PARALLELIZATIONS; REFERENCE ALGORITHM; SEQUENTIAL ALGORITHM; STATE OF THE ART; STRUCTURAL COMPARISON;

GRAPH ALGORITHMS;

PROTEIN;

ALGORITHM; BIOLOGY; CHEMICAL STRUCTURE; CHEMISTRY; COMPUTER GRAPHICS; PROCEDURES; PROTEIN CONFORMATION; TIME; ARTICLE; METHODOLOGY;

ALGORITHMS; COMPUTATIONAL BIOLOGY; COMPUTER GRAPHICS; MODELS, MOLECULAR; PROTEIN CONFORMATION; PROTEINS; TIME FACTORS;

EID: 84884559891     PISSN: 15499596     EISSN: 1549960X     Source Type: Journal    
DOI: 10.1021/ci4002525     Document Type: Article

References (32)

1. Karp, R. M. Reducibility among combinatorial problems; Plenum Press: New York, 1972.
2. Konc, J.; Janezic, D. ProBiS algorithm for detection of structurally similar protein binding sites by local structural alignment Bioinformatics 2010, 26, 1160-1168
3. Eblen, J.; Phillips, C.; Rogers, G.; Langston, M. The maximum clique enumeration problem: algorithms, applications, and implementations BMC Bioinformatics 2012, 13, S5
4. Barker, E. J.; Buttar, D.; Cosgrove, D. A.; Gardiner, E. J.; Kitts, P.; Willett, P.; Gillet, V. J. Scaffold hopping using clique detection applied to reduced graphs J. Chem. Inf. Model. 2006, 46, 503-511
5. Butenko, S.; Wilhelm, W. E. Clique-detection models in computational biochemistry and genomics Eur. J. Oper. Res. 2006, 173, 1-17
6. Artymiuk, P. J.; Poirrette, A. R.; Grindley, H. M.; Rice, D. W.; Willett, P. A graph-theoretic approach to the identification of three-dimensional patterns of amino acid side-chains in protein structures J. Mol. Biol. 1994, 243, 327-344
7. Artymiuk, P. J.; Poirrette, A. R.; Rice, D. W.; Willett, P. The use of graph theoretical methods for the comparison of the structures of biological macromolecules. In Molecular Similiarity II; Sen, K. D., Ed.; Springer: Berlin Heidelberg, 1995; pp 73-103.
8. Konc, J.; Janezic, D. ProBiS: a web server for detection of structurally similar protein binding sites Nucleic Acids Res. 2010, 38, W436-W440
9. Irwin, J. J.; Shoichet, B. K. ZINC-a free database of commercially available compounds for virtual screening J. Chem. Inf. Model. 2005, 45, 177-182
10. Raymond, J. W.; Gardiner, E. J.; Willett, P. Rascal: Calculation of graph similarity using maximum common edge subgraphs Comput. J. 2002, 45, 631-644
11. Raymond, J. W.; Gardiner, E. J.; Willett, P. Heuristics for similarity searching of chemical graphs using a maximum common edge subgraph algorithm J. Chem. Inf. Comp. Sci. 2002, 42, 305-316
12. Raymond, J. W.; Willett, P. Maximum common subgraph isomorphism algorithms for the matching of chemical structures J. Comput.-Aided Mol. Des. 2002, 16, 521-533
13. Prosser, P. Exact algorithms for maximum clique: A computational study Algorithms 2012, 5, 545-587
14. Carraghan, R.; Pardalos, P. M. An exact algorithm for the maximum clique problem Oper. Res. Lett. 1990, 9, 375-382
15. Tomita, E.; Sutani, Y.; Higashi, T.; Takahashi, S.; Wakatsuki, M. A simple and faster branch-and-bound algorithm for finding a maximum clique. In WALCOM: Algorithms and computation; Md. Saidur, R.; Satoshi, F., Eds.; Springer: Berlin Heidelberg, 2010; Vol. 5942, pp 191-203.
16. Konc, J.; Janezic, D. An improved branch and bound algorithm for the maximum clique problem MATCH Commun. Math. Comput. Chem. 2007, 58, 569-590
17. Fahle, T. Simple and fast: Improving a branch-and-bound algorithm for maximum clique Lect. Notes. Comput. Sc. 2002, 2461, 485-498
18. San Segundo, P.; Rodríguez-Losada, D.; Jiménez, A. An exact bit-parallel algorithm for the maximum clique problem Comput. Oper. Res. 2011, 38, 571-581
19. ÖstergaÌŠrd, P. R. J. A fast algorithm for the maximum clique problem Discrete Appl. Math. 2002, 120, 197-207
20. Pardalos, P. M.; Rappe, J.; Resende, M. G. C. An exact parallel algorithm for the maximum clique problem. In High Performance Algorithms and Software in Nonlinear Optimization; Kluwer Academic Publishers: Dordrecht, The Netherlands, 1998; pp 279-300.
21. McCreesh, C.; Prosser, P. Distributing an Exact Algorithm for Maximum Clique: maximising the costup Algorithms 2012, 5, 545-587
22. Konc, J.; Janezic, D. ProBiS-2012: web server and web services for detection of structurally similar binding sites in proteins Nucleic Acids Res. 2012, 40, W214-W221
23. Segundo, P.; Matia, F.; Rodriguez-Losada, D.; Hernando, M. An improved bit parallel exact maximum clique algorithm Optim. Lett. 2013, 7, 467-479
24. Konc, J.; Janezic, D. Protein-protein binding-sites prediction by protein surface structure conservation J. Chem. Inf. Model. 2007, 47, 940-944
25. Rose, P. W.; Bi, C.; Bluhm, W. F.; Christie, C. H.; Dimitropoulos, D.; Dutta, S.; Green, R. K.; Goodsell, D. S.; Prlic, A.; Quesada, M.; Quinn, G. B.; Ramos, A. G.; Westbrook, J. D.; Young, J.; Zardecki, C.; Berman, H. M.; Bourne, P. E. The RCSB Protein Data Bank: new resources for research and education Nucleic Acids Res. 2013, 41, D475-D482
26. Biggs, N. Some heuristics for graph coloring. In Graph Colourings; Longman: New York, 1990; pp 87-96.
27. Wood, D. R. An algorithm for finding a maximum clique in a graph Oper. Res. Lett. 1997, 21, 211-217
28. Tomita, E.; Kameda, T. An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments J. Global Optim. 2007, 37, 95-111
29. Tsai, C. C.; Johnson, M.; Nicholson, V.; Naim, M. A topological approach to molecular similarity analysis and its application. In Studies in Physical Theoretical Chemistry; Elsevier: USA, 1987; Vol. 51, pp 231-236.
30. Janezic, D.; Miličević, A.; Nikolić, S.; Trinajstić, N. Graph-Theoretical Matrices in Chemistry. Mathematical Chemistry Monographs, No. 3.; University of Kragujevac: Kragujevac, 2007.
31. Dijkstra, E. W. Solution of a problem in concurrent programming control Commun. ACM 1965, 8, 569
32. Bron, C.; Kerbosch, J. Algorithm 457: finding all cliques of an undirected graph Commun. ACM 1973, 16, 575-577