Fast similarity search for protein 3D structure databases using spatial topological patterns

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

It becomes too expensive computationally to compare a query protein with protein structures in a 3D structure databases for determining their similarity. Therefore, we emphasize that solving structural similarity search is to develop fast structure comparison algorithms. We propose a new method for comparing the structural similarity in protein structure databases with a given query protein by using topological pattern of proteins. In our approach, the geometry of SSEs(Secondary Structure Elements) is represented by spatial data types and indexed using an Rtree. We discover topological patterns of SSEs in 3D space using 9IM topological relations accelerated by Rtree index join to all the structures in 3D structure databases. A similarity search algorithm compares topological patterns of a query protein with those of proteins in the structure database. Experimental results show that execution time of our method is 3 times faster than DALITE while keeping the accuracy similar. This study identifies that similarity search based on spatial databases can find the similar structures rapidly and generate small candidate sets for the generalized alignment tools such as DALI and SSAP. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Park, S. H., & Ryu, K. H. (2004). Fast similarity search for protein 3D structure databases using spatial topological patterns. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3180, 771–780. https://doi.org/10.1007/978-3-540-30075-5_74

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free