Comparing graph representations of protein structure for mining family-specific residue-based packing motifs

Journal of Computational Biology

Volumn 12, Issue 6, 2005, Pages 657-671

  Huan, Jun ^a   Bandyopadhyay, Deepak ^a   Wang, Wei ^a,b   Snoeyink, Jack ^a   Prins, Jan ^a   Tropsha, Alexander ^a  

^a UNIVERSITY OF NORTH CAROLINA   (United States)

^b Brooks Computer Science Building   (United States)

Author keywords

Almost Delaunay; Frequent subgraph mining; Protein structure motifs

Indexed keywords

AMINO ACID; PROTEIN SERINE KINASE; SERINE PROTEINASE;

ALGORITHM; CONFERENCE PAPER; DATA BASE; MATHEMATICAL ANALYSIS; MOLECULAR DYNAMICS; PRIORITY JOURNAL; PROTEIN FAMILY; PROTEIN FUNCTION; PROTEIN STRUCTURE;

ALGORITHMS; AMINO ACID MOTIFS; COMPUTATIONAL BIOLOGY; COMPUTER GRAPHICS; DATABASES, PROTEIN; MODELS, MOLECULAR; MODELS, STATISTICAL; MOLECULAR STRUCTURE; PROTEINS; STRUCTURAL HOMOLOGY, PROTEIN;

EID: 23844484183     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2005.12.657     Document Type: Conference Paper

References (40)

1. Akutsu, H., Tamaki, H., and Tokuyama, T. 1997. Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets. 13th Ann. ACM Symp. on Computational Geometry, 314-323.
2. Bandyopadhyay, D., and Snoeyink, J. 2004. Almost-Delaunay simplices: Nearest neighbor relations for imprecise points. ACM-SIAM Symposium On Distributed Algorithms, 403-412.
3. Barber, C.B., Dobkin, D.P., and Huhdanpaa, H. 1996. The Quickhull algorithm for convex hulls. ACM Trans. Math. Softw. 22(4), 469-483.
4. Berman, H.M., Westbrook, J., Feng, Z., Gilliland, G., Bhat, T.N., Weissig, H., Shindyalov, I.N., and Bourne, P.E. 2000. The Protein Data Bank. Nucl. Acids Res. 28, 235-242.
5. Borgelt, C., and Berhold, M.R. 2002. Mining molecular fragments: Finding relevant substructures of molecules. Proc. Int. Conf. on Data Mining'02, 51-58.
6. Bradley, P., Kim, P.S., and Berger, B. 2002. TRILOGY: Discovery of sequence-structure patterns across diverse proteins. Proc. Natl. Acad. Sci. 99(13), 8500-8505.
7. Cammer, S.A., and Carter, C.W., and Tropsha, A. 2002. Identification of sequence-specific tertiary packing motifs in protein structures using Delaunay tessellation. Lecture Notes in Computational Science and Engineering 24, 477-494.
8. Chakraborty, S., and Biswas, S. 1999. Approximation algorithms for 3-D common substructure identification in drug and protein molecules. Workshop on Algorithms and Data Structures, 253-264.
9. Cormen, T.H., Leiserson, C.E., and Rivest, R.L. 2001. Introduction to Algorithms, MIT Press, Cambridge, MA.
10. Dehaspe, L., Toivonen, H., and King, R.D. 1998. Finding frequent substructures in chemical compounds. 4th Int. Conf. on Knowledge Discovery and Data Mining, 30-36.
11. Delaunay, B. 1934. Sur la sphère vide. A la memoire de Georges Voronoi. Izv. Akad. Nauk SSSR, Otdelenie Matematicheskih i Estestvennyh Nauk 7, 793-800.
12. Finn, P.W., Kavraki, L.E., Latombe, J., Motwani, R., Shelton, C.R., Venkatasubramanian, S., and Yao, A. 1997. RAPID: Randomized pharmacophore identification for drug design. Symp. Comp. Geometry, 324-333.
13. Fischer, D., Wolfson, H., Lin, S.L., and Nussinov, R. 1994. Three-dimensional, sequence order-independent structural comparison of a serine protease against the crystallographic database reveals active site similarities: Potential implication to evolution and to protein folding. Protein Sci. 3, 769-778.
14. Grindley, H.M., Artymiuk, P.J., Rice, D.W., and Willet, P. 1993. Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm. J. Mol. Biol. 229, 707-721.
15. Hofmann, S.K., Bucher, P., Falquet, L., and Bairoch, A. 1999. The PROSITE database, its status in 1999. Nucl. Acids Res. 27(1), 215-219.
16. Huan, J., Wang, W., and Prins, J. 2003. Efficient mining of frequent subgraph in the presence of isomorphism. ICDM'03, 549-552.
17. Huan, J., Wang, W., Bandyopadhyay, D., Snoeyink, J., Prins, J., and Tropsha, A. 2004a. Mining protein family specific residue packing patterns from protein structure graphs. In Eighth Annual International Conference on Research in Computational Molecular Biology (RECOMB), 308-315.
18. Huan, J., Wang, W., Prins, J., and Yang, J. 2004b. SPIN: Mining maximal frequent subgraphs from graph databases. ACM SIGKDD, 581-586.
19. Huan, J., Wang, W., Washington, A., Prins, J., Shah, R., and Tropsha, A. 2004c. Accurate classification of protein structural families based on coherent subgraph analysis. Proc. Pac. Symp. Biocomputing, 411-422.
20. Indyk, P., Motwani, R., and Venkatasubramanian, S. 1999. Geometric matching under noise: Combinatorial bounds and algorithms. ACM Symp. Disc. Alg., 457-465.
21. Inokuchi, A., Washio, T., and Motoda, H. 2000. An a priori-based algorithm for mining frequent substructures from graph data. PKDD'00, 13-23.
22. Jacobs, D.J., Rader, A.J., Kuhn, L.A., and Thorpe, M.F. 2001. Graph theory predictions of protein flexibility. Proteins: Struct. Funct. Genet. 44, 150-155.
23. Klein, P.N. 1998. Computing the edit-distance between unrooted ordered trees. Proc. 6th Ann. European Symp., 91-102.
24. Kleywegt, G.J. 1999. Recognition of spatial motifs in protein structures. J. Mol. Biol. 285(4), 1887-1897.
25. Kuramochi, M., and Karypis, G. 2001. Frequent subgraph discovery. Proc. Int. Conf. on Data Mining'01, 313-320.
26. Liang, J., Edelsbrunner, H., Fu, P., Sudhakar, P.V., and Subramaniam, S. 1998. Analytical shape computing of macromolecules I: Molecular area and volume through alpha shape. Proteins 33, 1-17.
27. β deviation. Proteins Struct. Funct. and Genet. 50, 437-450.
28. Milik, M., Szalma, S., and Olszewski, K.A. 2003. Common structural cliques: A tool for protein structure and function analysis. Protein Eng. 16(8), 543-552.
29. Mitchell, E.M., Artymiuk, P.J., Rice, D.W., and Willett, P. 1990. Use of techniques derived from graph theory to compare secondary structure motifs in proteins. J. Mol. Biol. 212, 151-166.
30. Murzin, A.G., Brenner, S.E., Hubbard, T., and Chothia, C. 1995. SCOP: A structural classification of proteins database for the investigation of sequences and structures. J. Mol. Biol. 247, 536-540.
31. Richards, F.M. 1974. The interpretation of protein structures: Total volume, group volume distributions, and packing density. J. Mol. Biol. 82, 1-14.
32. Singh, A.P., and Brutlag, D.L. 1997. Hierarchical protein structure superposition using both secondary structure and atomic representations. ISMB, 284-293.
33. Singh, R.K., Tropsha, A., and Vaisman, I.I. 1996. Delaunay tessellation of proteins. J. Comp. Biol. 3, 213-222.
34. Tropsha, A., Carter, C.W., Cammer, S., and Vaisman, I.I. 2003. Simplicial neighborhood analysis of protein packing (SNAPP): A computational geometry approach to studying proteins. Methods Enzymol. 374, 509-544.
35. Tsai, J., Taylor, R., Chothia, C., and Gerstein, M. 1999. The packing density in proteins: Standard radii and volumes. J. Mol. Biol. 290(1), 253-266.
36. Vishveshwara, S., Brinda, K.V., and Kannan, N. 2002. Protein structure: Insights from graph theory. J. Theor. Comp. Chem. 1(1), 187-211.
37. Wako, H., and Yamato, T. 1998. Novel method to detect a motif of local structures in different protein conformations. Protein Eng. 11, 981-990.
38. Wang, J., Shapiro, B.A., Sasha, D., Zhang, K., and Currey, K.M. 1998. An algorithm for finding the largest approximately common substructures of two trees. IEEE Trans, on Pattern Analysis and Machine Intelligence, 889-895.
39. Wernisch, L., Hunting, M., and Wodak, S.J. 1999. Identification of structural domains in proteins by a graph heuristic. Proteins 35(3), 338-352.
40. Yan, X., and Han, J. 2002. gSpan: Graph-based substructure pattern mining. Proc. Int. Conf. on Data Mining'02, 721-724.