{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:21:19Z","timestamp":1750306879925,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,1,17]],"date-time":"2013-01-17T00:00:00Z","timestamp":1358380800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,1,17]]},"DOI":"10.1145\/2448556.2448629","type":"proceedings-article","created":{"date-parts":[[2013,3,19]],"date-time":"2013-03-19T13:34:53Z","timestamp":1363700093000},"page":"1-8","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Fast protein 3D surface search"],"prefix":"10.1145","author":[{"given":"Sungchul","family":"Kim","sequence":"first","affiliation":[{"name":"POSTECH, Pohang, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lee","family":"Sael","sequence":"additional","affiliation":[{"name":"The State University of New York Korea, Incheon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hwanjo","family":"Yu","sequence":"additional","affiliation":[{"name":"POSTECH, Pohang, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,1,17]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","article-title":"Function prediction of uncharacterized proteins","author":"Hawkins T.","year":"2007","unstructured":"T. Hawkins and D. Kihara , \" Function prediction of uncharacterized proteins ,\" Bioinform. Comput. Biol. , pp. 1 -- 30 , 2007 . T. Hawkins and D. Kihara, \"Function prediction of uncharacterized proteins,\" Bioinform. Comput. Biol., pp. 1--30, 2007.","journal-title":"Bioinform. Comput. Biol."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1039\/b718229e"},{"key":"e_1_3_2_1_3_1","first-page":"377","article-title":"Predicting protein function from sequence and structural data","author":"Watson J.","year":"1996","unstructured":"J. Watson , R. Laskowski , and J. Thornton , \" Predicting protein function from sequence and structural data ,\" Curr. Opi. Struct. Biol. , pp. 377 -- 385 , 1996 . J. Watson, R. Laskowski, and J. Thornton, \"Predicting protein function from sequence and structural data,\" Curr. Opi. Struct. Biol., pp. 377--385, 1996.","journal-title":"Curr. Opi. Struct. Biol."},{"key":"e_1_3_2_1_4_1","volume-title":"Biol.","author":"Roberts R.","year":"2004","unstructured":"R. Roberts , \"Identifying protein function--a call for community action,\" PLoS . Biol. , 2004 . R. Roberts, \"Identifying protein function--a call for community action,\" PLoS. Biol., 2004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.2174\/1570164043488234"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btq127"},{"key":"e_1_3_2_1_7_1","first-page":"393","article-title":"Fast protein tertiary structure retrieval based on global surface shape similarity","author":"Lee S.","year":"2006","unstructured":"S. Lee , B. Li , D. La , Y. Fang , K. Ramani , R. Rustamov , and D. Kihara , \" Fast protein tertiary structure retrieval based on global surface shape similarity ,\" Curr Opin Struct Biol , pp. 393 -- 398 , 2006 . S. Lee, B. Li, D. La, Y. Fang, K. Ramani, R. Rustamov, and D. Kihara, \"Fast protein tertiary structure retrieval based on global surface shape similarity,\" Curr Opin Struct Biol, pp. 393--398, 2006.","journal-title":"Curr Opin Struct Biol"},{"key":"e_1_3_2_1_8_1","unstructured":"Y. Hwang and H.-K. Ahn \"Convergent bounds on the euclidean distance \" in NIPS 2011.  Y. Hwang and H.-K. Ahn \"Convergent bounds on the euclidean distance \" in NIPS 2011."},{"key":"e_1_3_2_1_9_1","unstructured":"Y. Hwang B. Han and H.-K. Ahn \"A fast nearest neighbor search algorithm by nonlinear embedding \" in CVPR 2012.   Y. Hwang B. Han and H.-K. Ahn \"A fast nearest neighbor search algorithm by nonlinear embedding \" in CVPR 2012."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0959-440X(96)80058-3"},{"key":"e_1_3_2_1_11_1","first-page":"739","article-title":"Protein structure alighment by incremental combinatorial extension (ce) of the optimal path","author":"Shindyalov I. N.","year":"1997","unstructured":"I. N. Shindyalov and P. E. Bourne , \" Protein structure alighment by incremental combinatorial extension (ce) of the optimal path ,\" Protein Eng. , pp. 739 -- 747 , 1997 . I. N. Shindyalov and P. E. Bourne, \"Protein structure alighment by incremental combinatorial extension (ce) of the optimal path,\" Protein Eng., pp. 739--747, 1997.","journal-title":"Protein Eng."},{"key":"e_1_3_2_1_12_1","first-page":"1013","volume-title":"Syst. for Mol. Biol. (ISMB)","author":"Singh A. P.","year":"2008","unstructured":"A. P. Singh and D. L. Brutlag , \" Hierarchical protein structure superposition using both secondary structure and atomic representations,\" in Intl . Syst. for Mol. Biol. (ISMB) , pp. 1013 -- 1022 , 2008 . A. P. Singh and D. L. Brutlag, \"Hierarchical protein structure superposition using both secondary structure and atomic representations,\" in Intl. Syst. for Mol. Biol. (ISMB), pp. 1013--1022, 2008."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jmbi.1993.1489"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/protein\/13.12.829"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0959-440X(95)80100-6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sbi.2006.04.007"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jmb.2003.10.027"},{"key":"e_1_3_2_1_18_1","first-page":"393","volume-title":"Conf. Intl. Syst. Mol. Biol.","author":"Gerstein M.","year":"2006","unstructured":"M. Gerstein and M. Levitt , \" Using iterative dynamic programming to obtain accurate pairwise and multiple alignments of ptotein structures,\" in Intl . Conf. Intl. Syst. Mol. Biol. , pp. 393 -- 398 , 2006 . M. Gerstein and M. Levitt, \"Using iterative dynamic programming to obtain accurate pairwise and multiple alignments of ptotein structures,\" in Intl. Conf. Intl. Syst. Mol. Biol., pp. 393--398, 2006."},{"key":"e_1_3_2_1_19_1","volume-title":"England","volume":"5","author":"Orengo C. A.","year":"1993","unstructured":"C. A. Orengo , A. D. Michie , S. Jones , D. T. Jones , M. B. Swindells , and J. M. Thornton , \" CATH--a hierarchic classification of protein domain structures.,\" Structure (London , England : 1993 ), vol. 5 , no. 8, pp. 1093--1108, 1997. C. A. Orengo, A. D. Michie, S. Jones, D. T. Jones, M. B. Swindells, and J. M. Thornton, \"CATH--a hierarchic classification of protein domain structures.,\" Structure (London, England: 1993), vol. 5, no. 8, pp. 1093--1108, 1997."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-2836(05)80134-2"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/26.1.316"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/prot.340230309"},{"key":"e_1_3_2_1_23_1","volume-title":"Identification of protein biochemical functions by similarity search using the molecular surface database ef-site,\" Protein Sci","author":"Kinoshita K.","year":"2003","unstructured":"K. Kinoshita and H. Nakamura , \" Identification of protein biochemical functions by similarity search using the molecular surface database ef-site,\" Protein Sci ., 2003 . K. Kinoshita and H. Nakamura, \"Identification of protein biochemical functions by similarity search using the molecular surface database ef-site,\" Protein Sci., 2003."},{"key":"e_1_3_2_1_24_1","first-page":"311","volume-title":"Conf. on Database Systems for Advanced Applications (DASFAA)","author":"Aung Z.","year":"2003","unstructured":"Z. Aung , W. Fu , and K. lee Tan , \"An efficient index-based protein structure database searching method,\" in Intl . Conf. on Database Systems for Advanced Applications (DASFAA) , pp. 311 -- 318 , 2003 . Z. Aung, W. Fu, and K. lee Tan, \"An efficient index-based protein structure database searching method,\" in Intl. Conf. on Database Systems for Advanced Applications (DASFAA), pp. 311--318, 2003."},{"key":"e_1_3_2_1_25_1","first-page":"316","article-title":"Scop database in 2002: refinements accommodate structural genomics","author":"Conte L. L.","year":"2002","unstructured":"L. L. Conte , S. E. Brenner , T. J. Hubbard , C. Chothia , and A. G. Murzin , \" Scop database in 2002: refinements accommodate structural genomics ,\" Nucleic. Acids Res. , pp. 316 -- 319 , 2002 . L. L. Conte, S. E. Brenner, T. J. Hubbard, C. Chothia, and A. G. Murzin, \"Scop database in 2002: refinements accommodate structural genomics,\" Nucleic. Acids Res., pp. 316--319, 2002.","journal-title":"Nucleic. Acids Res."},{"key":"e_1_3_2_1_26_1","volume-title":"Int. Conf. Very Large Databases (VLDB)","author":"Ciaccia P.","year":"1997","unstructured":"P. Ciaccia , M. Patella , and P. Zezula , \" M-tree: an efficient access method for similarity search in metric spaces,\" in Proc . Int. Conf. Very Large Databases (VLDB) , 1997 . P. Ciaccia, M. Patella, and P. Zezula, \"M-tree: an efficient access method for similarity search in metric spaces,\" in Proc. Int. Conf. Very Large Databases (VLDB), 1997."},{"key":"e_1_3_2_1_27_1","volume-title":"Int. Conf. Data Engineering (ICDE)","author":"Keim D.","year":"2000","unstructured":"D. Keim , \"Tutorial on high-dimensional index structures: Database support for next decades applications,\" in Proc . Int. Conf. Data Engineering (ICDE) , 2000 . D. Keim, \"Tutorial on high-dimensional index structures: Database support for next decades applications,\" in Proc. Int. Conf. Data Engineering (ICDE), 2000."},{"key":"e_1_3_2_1_28_1","volume-title":"Int. Conf. Data Engineering (ICDE)","author":"Bruno N.","year":"2002","unstructured":"N. Bruno , L. Gravano , and A. Marian , \" Evaluating top-k queries over web-accessible databases,\" in Proc . Int. Conf. Data Engineering (ICDE) , 2002 . N. Bruno, L. Gravano, and A. Marian, \"Evaluating top-k queries over web-accessible databases,\" in Proc. Int. Conf. Data Engineering (ICDE), 2002."},{"key":"e_1_3_2_1_29_1","volume-title":"Application of 3D Zernike descriptors to shape-based ligand similarity searching.,\" cheminformatics","author":"Venkatraman V.","year":"2009","unstructured":"V. Venkatraman , P. R. R. Chakravarthy , and D. Kihara , \" Application of 3D Zernike descriptors to shape-based ligand similarity searching.,\" cheminformatics , vol. 1 , 2009 . V. Venkatraman, P. R. R. Chakravarthy, and D. Kihara, \"Application of 3D Zernike descriptors to shape-based ligand similarity searching.,\" cheminformatics, vol. 1, 2009."},{"key":"e_1_3_2_1_30_1","first-page":"85","volume-title":"on Image Analysis","author":"Canterakis N.","year":"1999","unstructured":"N. Canterakis , \"3d zernike moments and zernike affine invariants for 3d image analysis and recognition,\" in 11th Scandinavian Conf . on Image Analysis , pp. 85 -- 93 , 1999 . N. Canterakis, \"3d zernike moments and zernike affine invariants for 3d image analysis and recognition,\" in 11th Scandinavian Conf. on Image Analysis, pp. 85--93, 1999."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/781606.781639"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btp542"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0263-7855(93)87010-3"}],"event":{"name":"ICUIMC '13: The 7th International Conference on Ubiquitous Information Management and Communication","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing","SKKU SUNGKYUNKWAN UNIVERSITY"],"location":"Kota Kinabalu Malaysia","acronym":"ICUIMC '13"},"container-title":["Proceedings of the 7th International Conference on Ubiquitous Information Management and Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448556.2448629","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2448556.2448629","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:18:32Z","timestamp":1750234712000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2448556.2448629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1,17]]},"references-count":33,"alternative-id":["10.1145\/2448556.2448629","10.1145\/2448556"],"URL":"https:\/\/doi.org\/10.1145\/2448556.2448629","relation":{},"subject":[],"published":{"date-parts":[[2013,1,17]]},"assertion":[{"value":"2013-01-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}