
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Zi Huang, Heng Tao Shen, Xiaofang Zhou, "Localized CoOccurrence Model for Fast Approximate Search in 3D Structure Databases," IEEE Transactions on Knowledge and Data Engineering, vol. 20, no. 4, pp. 519531, April, 2008.  
BibTex  x  
@article{ 10.1109/TKDE.2007.190729, author = {Zi Huang and Heng Tao Shen and Xiaofang Zhou}, title = {Localized CoOccurrence Model for Fast Approximate Search in 3D Structure Databases}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {20}, number = {4}, issn = {10414347}, year = {2008}, pages = {519531}, doi = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2007.190729}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Localized CoOccurrence Model for Fast Approximate Search in 3D Structure Databases IS  4 SN  10414347 SP519 EP531 EPD  519531 A1  Zi Huang, A1  Heng Tao Shen, A1  Xiaofang Zhou, PY  2008 KW  Simialrity Search KW  Approximate Search KW  Structural and Statistical Database VL  20 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] P. Artymiuk, R. Spriggs, and P. Willett, “Graph Theoretic Methods for the Analysis of Structural Relationships in Biological Macromolecules,” J. Am. Soc. Information Science and Technology, vol. 56, no. 5, pp. 518528, 2005.
[2] O. Amoglu, T. Kahveci, and A. Singh, “Towards IndexBased Similarity Search for Protein Structure Databases,” Proc. IEEE Bioinformatics Conf. (CSB '03), pp. 148158, 2003.
[3] L. Holm and C. Sander, “Searching Protein Structure Database Has Come of Age,” Proteins, vol. 19, pp. 165173, 1994.
[4] R. Spriggs, P. Artymiuk, and P. Willett, “Searching for Patterns of Amino Acids in 3D Protein Structures,” J. Chemical Information and Computer Sciences, vol. 43, no. 2, pp. 412421, 2003.
[5] E. Ingvar, J. Inge, and W.R. Taylor, Protein Bioinformatics: An Algorithmic Approach to Sequence and Structure Analysis. Wiley, 2004.
[6] T. Akutsu, H. Tamaki, and T. Tokuyama, “Distribution of Distances and Triangles in a Point Set and Algorithms for Computing the Largest Common Point Sets,” Discrete and Computational Geometry, pp. 307331, 1998.
[7] J.F. Gibrat, T. Madej, and S. Bryant, “Surprising Similarities in Structure Comparison,” Current Opinion in Structural Biology, vol. 6, pp. 377385, 1996.
[8] E. Gardiner, P. Artymiuk, and P. Willett, “CliqueDetection Algorithms for Matching ThreeDimensional Molecular Structures,” J. Molecular Graphics and Modeling, vol. 15, pp. 245253, 1997.
[9] H. Wolfson, “Geometric Hashing: An Overview,” IEEE Computational Science and Eng., vol. 4, no. 4, pp. 1021, 1997.
[10] N. Weskamp, D. Kuhn, E. Hüllermeier, and G. Klebe, “Efficient Similarity Search in Protein Structure Databases by $k$ Clique Hashing,” Bioinformatics, vol. 20, no. 10, pp. 15221526, 2004.
[11] “Protein Data Bank,” http://www.rcsb.orgpdb/, May 2007.
[12] Z. Xie and G.E. Farin, “Image Registration Using Hierarchical BSplines,” IEEE Trans. Visualization and Computer Graphics, vol. 10, no. 1, pp. 8594, Jan./Feb. 2004.
[13] H.P. Kriegel, S. Brecheisen, P. Krger, M. Pfeifle, and M. Schubert, “Using Sets of Feature Vectors for Similarity Search on Voxelized CAD Objects,” Proc. ACM SIGMOD '03, pp. 587598, 2003.
[14] B. Bustos, D.A. Keim, D. Saupe, T. Schreck, and D.V. Vranič, “FeatureBased Similarity Search in 3D Object Databases,” ACM Computing Surveys, vol. 37, no. 4, pp. 345387, 2005.
[15] H.S. Ip and Y.F. Wong, “3D Head Models Retrieval Based on Hierarchical Facial Region Similarity,” Proc. 15th Int'l Conf. Vision Interface (VI '02), pp. 314319, 2002.
[16] R. Ohbuchi, T. Otagiri, M. Ibato, and T. Takei, “ShapeSimilarity Search of ThreeDimensional Models Using Parameterized Statistics,” Proc. 10th Pacific Conf. Computer Graphics and Applications (PG '02), pp. 265273, 2002.
[17] R. Ohbuchi, T. Minamitani, and T. Takei, “ShapeSimilarity Search of 3D Models by Using Enhanced Shape Functions,” Proc. Theory and Practice of Computer Graphics, p. 97, 2003.
[18] R. Osada, T. Funkhouser, B. Chazelle, and D. Dobkin, “Shape Distributions,” ACM Trans. Graphics, vol. 21, no. 4, pp. 807832, 2002.
[19] E. Paquet, M. Rioux, A. Murching, T. Naveen, and A. Batabai, “Description of Shape Information for 2D and 3D Objects,” Signal Processing: Image Comm., vol. 16, pp. 103122, 2000.
[20] M. Ankerst, G. Kastenmüller, H.P. Kriegel, and T. Seidl, “3D Shape Histograms for Similarity Search and Classification in Spatial Databases,” Proc. Sixth Int'l Symp. Advances in Spatial Databases (SSD '99), pp. 207226, 1999.
[21] D.A. Keim, “Efficient GeometryBased Similarity Search of 3D Spatial Databases,” Proc. ACM SIGMOD '99, pp. 419430, 1999.
[22] T. Funkhouser, P. Min, M. Kazhdan, J. Chen, A. Halderman, D. Dobkin, and D. Jacobs, “A Search Engine for 3D Models,” ACM Trans. Graphics, vol. 22, no. 1, pp. 83105, 2003.
[23] T. Zaharia and F. Prêteux, “ShapeBased Retrieval of 3D Mesh Models,” Proc. IEEE Int'l Conf. Multimedia and Expo (ICME '02), 2002.
[24] L. Holm and C. Sander, “Mapping the Protein Universe,” Science, vol. 273, pp. 595603, 1996.
[25] S. Chakraborty and S. Biswas, “Approximation Algorithms for 3D Common Substructure Identification in Drug and Protein Molecules,” Proc. Sixth Workshop Algorithms and Data Structures (WADS '99), pp. 253264, 1999.
[26] V. Choi and N. Goyal, “An Efficient Approximation Algorithm for Point Pattern Matching under Noise,” Proc. Seventh Latin Am. Symp. Theoretical Informatics (LATIN '06), pp. 298310, 2006.
[27] C. Bron and J. Kerbosch, “Algorithm 457: Finding All Cliques of an Undirected Graph,” Comm. ACM, vol. 16, no. 9, pp. 575577, 1973.
[28] D. Mount, Bioinformatics: Sequence and Genome Analysis. Cold Spring Harbor Laboratory Press, 2001.
[29] A. Efrat and A. Itai, “Improvements on Bottleneck Matching and Related Problems Using Geometry,” Proc. 12th ACM Ann. Symp. Computational Geometry (SCG '96), pp. 301310, 1996.
[30] H.V. Jagadish, B.C. Ooi, K.L. Tan, C. Yu, and R. Zhang, “iDistance: An Adaptive ${\rm b}^{+}\hbox{}{\rm Tree}$ Based Indexing Method for Nearest Neighbor Search,” ACM Trans. Database Systems, vol. 30, no. 2, pp. 364397, 2005.
[31] R. Weber, H. Schek, and S. Blott, “A Quantitative Analysis and Performance Study for SimilaritySearch Methods in HighDimensional Spaces,” Proc. 24th Int'l Conf. Very Large Data Bases (VLDB '98), pp. 194205, 1998.
[32] N. Koudas, B.C. Ooi, H.T. Shen, and A. Tung, “LDC: Enabling Search by Partial Distance in a HyperDimensional Space,” Proc. 20th IEEE Int'l Conf. Data Eng. (ICDE '04), pp. 617, 2004.
[33] M.E. Houle and J. Sakuma, “Fast Approximate Similarity Search in Extremely HighDimensional Data Sets,” Proc. 21st IEEE Int'l Conf. Data Eng. (ICDE '05), 2005.
[34] A. Andreeva, D. Howorth, C. Brenner, T.J. Hubbard, C. Chothia, and A.G. Murzin, “Scop Database in 2004: Refinements Integrate Structure and Sequence Family Data,” Nucleic Acids Research, vol. 32, pp. 226229, 2004.
[35] “SCOP: Structural Classification of Proteins,” http://scop.mrclmb.cam.ac.ukscop/, 2006.
[36] X. Wang and J.T.L. Wang, “Fast Similarity Search in ThreeDimensional Structure Databases,” J. Chemical Information and Computer Sciences, vol. 40, no. 2, pp. 442451, 2000.