PSI: indexing protein structures for fast similarity search | Zendy

Orhan Çamoǧlu | Zendy; Tamer Kahveci | Zendy; Ambuj K. Singh | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

PSI: indexing protein structures for fast similarity search

Author(s) -

Orhan Çamoǧlu,

Tamer Kahveci,

Ambuj K. Singh

Publication year - 2003

Publication title -

bioinformatics

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 3.599

H-Index - 390

eISSN - 1367-4811

pISSN - 1367-4803

DOI - 10.1093/bioinformatics/btg1009

Subject(s) - search engine indexing , computer science , feature (linguistics) , nearest neighbor search , similarity (geometry) , scalability , pruning , data structure , protein structure database , index (typography) , data mining , database index , feature vector , structural alignment , database , information retrieval , artificial intelligence , sequence alignment , sequence database , biology , linguistics , philosophy , biochemistry , world wide web , gene , agronomy , image (mathematics) , programming language , peptide sequence

We consider the problem of finding similarities in protein structure databases. Current techniques sequentially compare the given query protein to all of the proteins in the database to find similarities. Therefore, the cost of similarity queries increases linearly as the volume of the protein databases increase. As the sizes of experimentally determined and theoretically estimated protein structure databases grow, there is a need for scalable searching techniques.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research