Open Access System for Information Sharing

Login Library

 

Article
Cited 0 time in webofscience Cited 1 time in scopus
Metadata Downloads

Efficient Protein Structure Search Using Indexing Methods SCIE SCOPUS

Title
Efficient Protein Structure Search Using Indexing Methods
Authors
Sungchul KimLee SaelYu, H
Date Issued
2013-04-05
Publisher
Springer
Abstract
Understanding functions of proteins is one of the most important challenges in many studies of biological processes. The function of a protein can be predicted by analyzing the functions of structurally similar proteins, thus finding structurally similar proteins accurately and efficiently from a large set of proteins is crucial. A protein structure can be represented as a vector by 3D-Zernike Descriptor (3DZD) which compactly represents the surface shape of the protein tertiary structure. This simplified representation accelerates the searching process. However, computing the similarity of two protein structures is still computationally expensive, thus it is hard to efficiently process many simultaneous requests of structurally similar protein search. This paper proposes indexing techniques which substantially reduce the search time to find structurally similar proteins. In particular, we first exploit two indexing techniques, i.e., iDistance and iKernel, on the 3DZDs. After that, we extend the techniques to further improve the search speed for protein structures. The extended indexing techniques build and utilize an reduced index constructed from the first few attributes of 3DZDs of protein structures. To retrieve top-k similar structures, top-10 x k similar structures are first found using the reduced index, and top-k structures are selected among them. We also modify the indexing techniques to support theta-based nearest neighbor search, which returns data points less than theta to the query point. The results show that both iDistance and iKernel significantly enhance the searching speed. In top-k nearest neighbor search, the searching time is reduced 69.6%, 77%, 77.4% and 87.9%, respectively using iDistance, iKernel, the extended iDistance, and the extended iKernel. In theta-based nearest neighbor serach, the searching time is reduced 80%, 81%, 95.6% and 95.6% using iDistance, iKernel, the extended iDistance, and the extended iKernel, respectively.
Keywords
FOLD SPACE; DATABASE; CLASSIFICATION; SIMILARITY; ALIGNMENT
URI
https://oasis.postech.ac.kr/handle/2014.oak/15341
DOI
10.1186/1472-6947-13-S1-S8
ISSN
1472-6947
Article Type
Article
Citation
BMC Medical Informatics and Decision Making, vol. 13, no. S8, 2013-04-05
Files in This Item:
There are no files associated with this item.

qr_code

  • mendeley

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

Related Researcher

Researcher

유환조YU, HWANJO
Dept of Computer Science & Enginrg
Read more

Views & Downloads

Browse