Mining protein family specific residue packing patterns from protein structure graphs

Proceedings of the Annual International Conference on Computational Molecular Biology, RECOMB

Volumn 8, Issue , 2004, Pages 308-315

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

^a UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Almost Delaunay; Delaunay Tessellation; Protein Classification; Subgraph Mining

Indexed keywords

AMINO ACIDS; APPROXIMATION THEORY; BIOCHEMISTRY; COMPUTATIONAL METHODS; DATA MINING; GENES; GRAPH THEORY; PROBLEM SOLVING;

ALMOST-DELAUNAY; DELAUNAY TESSELLATION; PROTEIN CLASSIFICATION; SUBGRAPH MINING;

PROTEINS;

EID: 2442564572     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/974614.974655     Document Type: Conference Paper

References (36)

1. D. Bandyopadhyay and J. Snoeyink. Almost-Delaunay simplices: Nearest neighbor relations for imprecise points. In ACM-SIAM Symposium On Distributed Algorithms, pages 403-412, 2004.
2. C. B. Barber, D. P. Dobkin, and H. Huhdanpaa. The Quickhull algorithm for convex hulls. ACM Trans. Math. Softw., 22(4):469-483, 1996.
3. C. Borgelt and M. R. Berhold. Mining molecular fragments: Finding relevant substructures of molecules. In Proc. International Conference on Data Mining'02.
4. S. Chakraborty and S. Biswas. Approximation algorithms for 3-d common substructure identification in drug and protein molecules. Workshop on Algorithms and Data Structures, pages 253-264, 1999.
5. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT press, 2001.
6. L. Dehaspe, H. Toivonen, and R. D. King. Finding frequent substructures in chemical compounds. In 4th International Conference on Knowledge Discovery and Data Mining, pages 30-36, 1998.
7. B. Delaunay. Sur la sphère vide. A la memoire de Georges Voronoi. Izv. Akad. Nauk SSSR, Otdelenie Matematicheskih i Estestvennyh Nauk, 7:793-800, 1934.
8. P. W. Finn, L. E. Kavraki, J. Latombe, R. Motwani, C. R. Shelton, S. Venkatasubramanian, and A. Yao. Rapid: Randomized pharmacophore identification for drug design. Symposium on Computational Geometry, pages 324-333, 1997.
9. D. Fischer, H. Wolfson, S. L. Lin, and R. Nussinov. 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 Science, 3:769-778, 1994.
10. H. Grindley, P. Artymiuk, D. Rice, and P. Willet. Identification of tertiary structure resemblance in proteins using a maximal common subgraph isomorphism algorithm. J. Mol. biol., 229:707-721, 1993.
11. M. Hochsmann, T. Toller, R. G., and S. Kurtz. Local similarity in RNA secondary structures. In Proc. Computational Systems Bioinformatics, pages 159-168.
12. S. K. Hofmann, P. Bucher, L. Falquet, and A. Bairoch. The prosite database, its status in 1999. Nucleic Acids Res, 27(1):215-219, 1999.
13. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. In Proc. International Conference on Data Mining '03.
14. J. Huan, W. Wang, and J. Prins. Efficient mining of frequent subgraph in the presence of isomorphism. UNC computer science technical report TR03-021, 2003.
15. J. Huan, W. Wang, A. Washington, J. Prins, R. Shah, and A. Tropsha. Accurate classification of protein structural families based on coherent subgraph analysis. In Proc. Pacific Symposium on Biocomputing, 2004.
16. P. Indyk, R. Motwani, and S. Venkatasubramanian. Geometric matching under noise: Combinatorial bounds and algorithms. ACM Symposium on Discrete Algorithms, 1999.
17. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In PKDD'00.
18. D. Jacobs, A. Rader, L. Kuhn, and M. Thorpe. Graph theory predictions of protein flexibility. Proteins; Struct. Funct. Genet., 44:150-155, 2001.
19. P. N. Klein. Computing the edit-distance between unrooted ordered trees. In Proc. 6th Annual Enropean Symposium, pages 91-102, 1998.
20. G. J. Kleywegt. Recognition of spatial motifs in protein structures. Journal of Molecular Biology, 285(4): 1887-1897, 1999.
21. M. Kuramochi and G. Karypis. Frequent subgraph discovery. In Proc. International Conference on Data Mining'01.
22. J. Liang, H. Edelsbrunner, P. Fu, P. Sudhakar, and S. Subramaniam. Analytical shape computing of macromolecules I: molecular area and volume through alpha shape. Proteins, 33:1-17, 1998.
23. A. Murzin, S. Brenner, T. Hubbard, and C. Chothia. SCOP: a structural classification of proteins database for the investigation of sequences and structures. Journal of Molecular Biology, 247:536-40, 1995.
24. F. M. Richards. The interpretation of protein structures: total volume, group volume distributions, and packing density. J. Molecular Biology, 82:1-14, 1974.
25. B. Shapiro. An algorithm for comparing multiple RNA secondary structures. Comp. Appl. Biosci, 4(3):387-393, 1988.
26. R. Singh, A. Tropsha, and I. Vaisman. Delaunay tessellation of proteins. J. Comput. Biol., 3:213-222, 1996.
27. H. T. T. Akutsu and T. Tokuyama. Distribution of distances and triangles in a point set and algorithms for computing the largest common point sets. In 13th Annual ACM Symp. on Computational Geometry, pages 314-323, 1997.
28. A. Tropsha, C. Carter, S. Cammer, and I. Vaisman. Simplicial neighborhood analysis of protein packing (SNAPP): a computational geometry approach to studying proteins. Methods Enzymol., 374:509-544, 2003.
29. J. Tsai, R. Taylor, C. Chothia, and M. Gerstein. The packing density in proteins: Standard radii and volumes. Journal of Molecular Biology, 290(1):253-266, 1999.
30. V. Vapnik. Statistical Learning Theory. John Wiley, 1998.
31. S. Vishveshwara, K. V. Brinda, and N. Kannan. Protein structure: Insights from graph theory. J. of Theo. and Comp. Chem., 1(1): 187-211, 2002.
32. H. Wako and T. Yamato. Novel method to detect a motif of local structures in different protein conformations. Protein Engineering, 11:981-990, 1998.
33. J. Wang, B. Shapiro, D. Sasha, K. Zhang, and K. M. Currey. A algorithm for finding the largest approximately common substructures of two trees. IEEE Transactions on Pattern Anaylsis and Machine Intelligence.
34. L. Wernisch, M. Hunting, and S. Wodak. Identification of structural domains in proteins by a graph heuristic. Proteins, 35(3):338-352, 1999.
35. X. Van and J. Han. gspan: Graph-based substructure pattern mining. In Proc. International Conference on Data Mining'02.
36. K. Zhang, R. Stgatman, and D. Shasha. Simple fast algorithm for the editing distance between trees and related problems. SIAM Journal on Computing, 18(6):1245-1262, 1989.