Abstract
In this paper we study the protein structure comparison problem where each protein is modeled as a sequence of 3D points, and a contact edge is placed between every two of these points that are sufficiently close. Given two proteins represented this way, our problem is to find a subset of points from each protein, and a bijective matching of points between these two subsets, with the objective of maximizing either (A) the size of the subsets (LCP problem), or (B) the number of edges that exist simultaneously in both subsets (CMO problem), under the requirement that only points within a specified proximity can be matched. It is known that the general CMO problem (without the proximity requirement) is hard to approximate. However, with the proximity requirement, it is known that if a minimum inter-residue distance is imposed on the input, approximate solutions can be efficiently obtained. In this paper we mainly show that the CMO problem under these conditions: (1) is NP-hard, but (2) allows a PTAS. The rest of this paper shows algorithms for the LCP problem which improves on known results.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akutsu, T.: Protein structure alignment using dynamic programming and iterative improvement. IEICE Trans. Inf. and Sys. E79-D(12), 1629–1636 (1996)
Akutsu, T., Tashimo, H.: Protein structure comparison using representation by line segment sequences. In: Proc. Pacific Symp. on Biocomputing 1996, pp. 25–40 (1996)
Alexandrov, N.N.: SARFing the PDB. Protein Eng. 9(9), 727–732 (1996)
Ambühl, C., Chakraborty, S., Gärtner, B.: Computing largest common point sets under approximate congruence. In: Paterson, M. (ed.) ESA 2000. LNCS, vol. 1879, pp. 52–64. Springer, Heidelberg (2000)
Bondy, J.A.: Graph Theory With Applications. Elsevier Science Ltd., Amsterdam (1976)
Caprara, A., Lancia, G.: Structural alignment of large-size proteins via lagrangian relaxation. In: RECOMB 2002, pp. 100–108. ACM, New York (2002)
Chakraborty, S., Biswas, S.: Approximation algorithms for 3-D common substructure identification in drug and protein molecules. In: Dehne, F., Gupta, A., Sack, J.-R., Tamassia, R. (eds.) WADS 1999. LNCS, vol. 1663, pp. 253–264. Springer, Heidelberg (1999)
Comin, M., Guerra, C., Zanotti, G.: PROuST: A comparison method of three-dimensional structure of proteins using indexing techniques. J. of Comp. Biol. 11, 1061–1072 (2004)
Dyer, M.E., Frieze, A.M.: Planar 3DM is NP-complete. J. of Algorithms 7(2), 174–184 (1986)
Gerstein, M., Levitt, M.: Using iterative dynamic programming to obtain accurate pairwise and multiple alignments of protein structures. In: ISMB 1996, pp. 59–67. AAAI Press, Menlo Park (1996)
Gibrat, J.F., Madej, T., Bryant, S.H.: Surprising similarities in structure comparison. Current Opinion in Structural Biology 6(3), 377–385 (1996)
Goldman, D., Papadimitriou, C.H., Istrail, S.: Algorithmic aspects of protein structure similarity. In: FOCS 1999, pp. 512–521. IEEE Computer Society, Los Alamitos (1999)
Holm, L., Sander, C.: Protein structure comparison by alignment of distance matrices. J. Mol. Biol. 233(1), 123–138 (1993)
Hopcroft, J.E., Karp, R.M.: An n 5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing 2(4), 225–231 (1973)
Kolodny, R., Linial, N.: Approximate protein structural alignment in polynomial time. Proc. Natl. Acad. Sci. 101, 12201–12206 (2004)
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, pp. 193–202. ACM, New York (2001)
Lancia, G., Istrail, S.: Protein Structure Comparison: Algorithms and Applications. In: Guerra, C., Istrail, S. (eds.) Mathematical Methods for Protein Structure Analysis and Design. LNCS (LNBI), vol. 2666, pp. 1–33. Springer, Heidelberg (2003)
Lemmen, C., Lengauer, T.: Computational methods for the structural alignment of molecules. J. Comput. Aided Mol. Des. 14(3), 215–232 (2000)
Li, S.C., Bu, D., Xu, J., Li, M.: Finding largest well-predicted subset of protein structure models. In: Ferragina, P., Landau, G.M. (eds.) CPM 2008. LNCS, vol. 5029, pp. 44–55. Springer, Heidelberg (2008)
Singh, A.P., Brutlag, D.L.: Hierarchical protein structure superposition using both secondary structure and atomic representations. In: ISMB 1997, pp. 284–293. AAAI Press, Menlo Park (1997)
Xu, J., Jiao, F., Berger, B.: A parameterized algorithm for protein structure alignment. J. of Comp. Biol. 14(5), 564–577 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Li, S.C., Ng, Y.K. (2009). On Protein Structure Alignment under Distance Constraint. In: Dong, Y., Du, DZ., Ibarra, O. (eds) Algorithms and Computation. ISAAC 2009. Lecture Notes in Computer Science, vol 5878. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10631-6_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-10631-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10630-9
Online ISBN: 978-3-642-10631-6
eBook Packages: Computer ScienceComputer Science (R0)