Fast filtering of structural similarity search using discovery of topological patterns

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

Abstract

Similarity search for protein 3D structure databases is much more complex and computationally expensive. It is essential to improve performance on the existing comparison systems such as DALI and VAST. In our approach, the structural similarity search composes of a filter step to generate small candidate set and a refinement step to compute structural alignment. This paper describes fast filtering of similarity search using discovery of topological patterns of secondary structure elements based on spatial relations. Our system is fully implemented by using Oracle 8i spatial. Experimental results show that our method is approximately three times faster than DaliLite. © Springer-Verlag Berlin Heidelberg 2004.

Cite

CITATION STYLE

APA

Park, S. H., & Ryu, K. H. (2004). Fast filtering of structural similarity search using discovery of topological patterns. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3177, 396–401. https://doi.org/10.1007/978-3-540-28651-6_58

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