Abstract
Computing the similarity between two protein structures is a crucial task in molecular biology, and has been extensively investigated. Many protein structure comparison methods can be modeled as maximum clique problems in specific k-partite graphs, referred here as alignment graphs. In this paper, we propose a new protein structure comparison method based on internal distances (DAST), which main characteristic is that it generates alignments having RMSD smaller than any previously given threshold. DAST is posed as a maximum clique problem in an alignment graph, and in order to compute DAST’s alignments, we also design an algorithm (ACF) for solving such maximum clique problems. We compare ACF with one of the fastest clique finder, recently conceived by Östergȧrd. On a popular benchmark (the Skolnick set) we observe that ACF is about 20 times faster in average than the Östergȧrd’s algorithm. We then successfully use DAST’s alignments to obtain automatic classification in very good agreement with SCOP.
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.
References
Godzik, A.: The structural alignment between two proteins: Is there a unique answer? Protein Science (7), 1325–1338 (1996)
Sierk, M., Kleywegt, G.: Déjà vu all over again: Finding and analyzing protein structure similarities. Structure 12(12), 2103–2111 (2004)
Konc, J., Janezic, D.: An efficient branch-and-bound algorithm for finding a maximum clique. Discrete Mathematics and Theoretical Computer Science 58, 220 (2003)
Tomita, E., Seki, T.: An improved branch and bound algorithm for the maximum clique problem. Communications in Mathematical and in Computer Chemistry / MATCH 58, 569–590 (2007)
Östergård, P.R.J.: A fast algorithm for the maximum clique problem. Discrete Applied Mathematics 120(1-3), 197–207 (2002)
Andreeva, A., Howorth, D., Chandonia, J.M., Brenner, S., Hubbard, T., Chothia, C., Murzin, A.: Data growth and its impact on the SCOP database: new developments. Nucl. Acids Res. 36, 419–425 (2007)
Strickland, D., Barnes, E., Sokol, J.: Optimal protein structure alignment using maximum cliques. Oper. Res. 53(3), 389–402 (2005)
Karp, R.: Reducibility among combinatorial problems. Complexity of Computer Computations 6, 85–103 (1972)
Bomze, I., Budinich, M., Pardalos, P., Pelillo, M.: The maximum clique problem. Handbook of Combinatorial Optimization (1999)
Gibrat, J.F., Madej, T., Bryant, S.: Surprising similarities in structure comparison. Current Opinion in Structural Biology 6, 377–385 (1996)
Godzik, A., Skolnick, J.: Flexible algorithm for direct multiple alignment of protein structures and sequences. CABIOS 10, 587–596 (1994)
Andonov, R., Yanev, N., Malod-Dognin, N.: An efficient lagrangian relaxation for the contact map overlap problem. In: Crandall, K.A., Lagergren, J. (eds.) WABI 2008. LNCS (LNBI), vol. 5251, pp. 162–173. Springer, Heidelberg (2008)
Caprara, A., Carr, R., Israil, S., Lancia, G., Walenz, B.: 1001 optimal PDB structure alignments: integer programming methods for finding the maximum contact map overlap. J. Comput. Biol. 11(1), 27–52 (2004)
Fredman, M.: On computing the length of longest increasing subsequences. Discrete Mathematics 11, 29–35 (1975)
Martin, J., Letellier, G., Marin, A., Taly, J.F., de Brevern, A., Gibrat, J.F.: Protein secondary structure assignment revisited: a detailed analysis of different assignment methods. BMC Structural Biology 5, 17 (2005)
Lancia, G., Carr, R., Walenz, B., Istrail, S.: 101 optimal pdb structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem. In: RECOMB 2001: Proceedings of the fifth annual international conference on Computational biology, pp. 193–202 (2001)
Lerman, I.: Likelihood linkage analysis (lla) classification method (around an example treated by hand). Biochimie 75(5), 379–397 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Malod-Dognin, N., Andonov, R., Yanev, N. (2010). Maximum Cliques in Protein Structure Comparison. In: Festa, P. (eds) Experimental Algorithms. SEA 2010. Lecture Notes in Computer Science, vol 6049. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13193-6_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-13193-6_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13192-9
Online ISBN: 978-3-642-13193-6
eBook Packages: Computer ScienceComputer Science (R0)