Sciweavers

Share
RECOMB
2009
Springer

Searching Protein 3-D Structures in Linear Time

12 years 2 months ago
Searching Protein 3-D Structures in Linear Time
Finding similar structures from 3-D structure databases of proteins is becoming more and more important issue in the post-genomic molecular biology. To compare 3-D structures of two molecules, biologists mostly use the RMSD (root mean square deviation) as the similarity measure. We propose new theoretically and practically fast algorithms for the fundamental problem of finding all the substructures of structures in a structure database of chain molecules (such as proteins), whose RMSDs to the query are within a given constant threshold. We first propose a breakthrough linear-expected-time algorithm for the problem, while the previous best-known time complexity was O(N log m), where N is the database size and m is the query size. For the expected time analysis, we propose to use the random-walk model (or the ideal chain model) as the model of average protein structures. We furthermore propose a series of preprocessing algorithms that enable faster queries. We checked the performance of ...
Tetsuo Shibuya
Added 23 Nov 2009
Updated 23 Nov 2009
Type Conference
Year 2009
Where RECOMB
Authors Tetsuo Shibuya
Comments (0)
books