Abstract
Aligning and comparing two polygonal chains in 3D space is an important problem in many areas of research, like in protein structure alignment. A lot of research has been done in the past on this problem, using RMSD as the distance measure. Recently, the discrete Fréchet distance has been applied to align and simplify protein backbones (geometrically, 3D polygonal chains) by Jiang et al., with insightful new results found. On the other hand, as a protein backbone can have as many as 500~600 vertices, even if a pair of chains are nicely aligned, as long as they are not identical, it is still difficult for humans to visualize their similarity and difference. In 2008, a problem called CPS-3F was proposed to simplify a pair of 3D chains simultaneously under the discrete Fréchet distance. However, it is still open whether CPS-3F is NP-complete or not. In this paper, we first present a new practical method to align a pair of protein backbones, improving the previous method by Jiang et al. Finally, we present a greedy-and-backtrack method, using the new alignment method as a subroutine, to handle the CPS-3F problem. We also prove two simple lemmas, giving some evidence to why our new method works well. Some preliminary empirical results using some proteins from the Protein Data Bank (PDB), with comparisons to the previous method, are presented.
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
Alt, H., Behrends, B., Blömer, J.: Approximate matching of polygonal shapes (extended abstract). In: Proceedings of the 7th Annual Symposium on Computational Geometry (SoCG 1991), pp. 186–193 (1991)
Alt, H., Godau, M.: Measuring the resemblance of polygonal curves. In: Proceedings of the 8th Annual Symposium on Computational Geometry (SoCG 1992), pp. 102–109 (1992)
Alt, H., Godau, M.: Computing the frechet distance between two polygonal curves. Internat. J. Comput. Geom. Appl. 5, 75–91 (1995)
Alt, H., Knauer, C., Wenk, C.: Matching polygonal curves with respect to the fréchet distance. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 63–74. Springer, Heidelberg (2001)
Bereg, S., Jiang, M., Wang, W., Yang, B., Zhu, B.: Simplifying 3D polygonal chains under the discrete Fréchet distance. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol. 4957, pp. 630–641. Springer, Heidelberg (2008)
Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34, 200–208 (1987)
Conte, L., Ailey, B., Hubbard, T., Brenner, S., Murzin, A., Chothia, C.: SCOP: a structural classification of protein database. Nucleic Acids Research 28, 257–259 (2000)
Eiter, T., Mannila, H.: Computing discrete Fréchet distance. Tech. Report CD-TR 94/64, Information Systems Department, Technical University of Vienna (1994)
Fréchet, M.: Sur quelques points du calcul fonctionnel. Rendiconti del Circolo Mathematico di Palermo 22, 1–74 (1906)
Holm, L., Park, J.: DaliLite workbench for protein structure comparison. Bioinformatics 16, 566–567 (2000)
Holm, L., Sander, C.: Protein structure comparison by alignment of distance matrices. J. Mol. Biol. 233, 123–138 (1993)
Jiang, M., Xu, Y., Zhu, B.: Protein structure-structure alignment with discrete Fréchet distance. J. of Bioinformatics and Computational Biology 6, 51–64 (2008)
Mauzy, C., Hermodson, M.: Structural homology between rbs repressor and ribose binding protein implies functional similarity. Protein Science 1, 843–849 (1992)
Needleman, S., Wunsch, C.: A general method applicable to the search for similarities in the amino acid sequence of two proteins. J. Mol. Biol. 48, 443–453 (1970)
Orengo, C., Michie, A., Jones, S., Jones, D., Swindles, M., Thornton, J.: CATH—a hierarchic classification of protein domain structures. Structure 5, 1093–1108 (1997)
Oritz, A., Strauss, C., Olmea, O.: MAMMOTH (matching molecular models obtained from theory): an automated method for model comparison. Protein Science 11, 2606–2621 (2002)
Shindyalov, I., Bourne, P.: Protein structure alignment by incremental combinatorial extension (CE) of the optimal path. Protein Engineering 11, 739–747 (1998)
Shyu, C.-R., Chi, P.-H., Scott, G., Xu, D.: ProteinDBS: a real-time retrieval system for protein structure comparison. Nucleic Acids Research 32, W572–W575 (2004)
Taylor, W., Orengo, C.: Protein structure alignment. J. Mol. Biol. 208, 1–22 (1989)
Wenk, C.: Shape Matching in Higher Dimensions. PhD thesis, Freie Universitaet Berlin (2002)
Yang, J.-M., Tung, C.-H.: Protein structure database search and evolutionary classification. Nucleic Acids Research 34, 3646–3659 (2006)
Zhu, B.: Protein local structure alignment under the discrete Fréchet distance. J. Computational Biology 14(10), 1343–1351 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wylie, T., Luo, J., Zhu, B. (2011). A Practical Solution for Aligning and Simplifying Pairs of Protein Backbones under the Discrete Fréchet Distance. In: Murgante, B., Gervasi, O., Iglesias, A., Taniar, D., Apduhan, B.O. (eds) Computational Science and Its Applications - ICCSA 2011. ICCSA 2011. Lecture Notes in Computer Science, vol 6784. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21931-3_6
Download citation
DOI: https://doi.org/10.1007/978-3-642-21931-3_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21930-6
Online ISBN: 978-3-642-21931-3
eBook Packages: Computer ScienceComputer Science (R0)