Progress: simultaneous searching of protein databases by sequence and structure.
We consider the problem of similarity searches on protein databases based on both sequence and structure information simultaneously. Our program extracts feature vectors from both the sequence and structure components of the proteins. These feature vectors are then combined and indexed using a novel multi-dimensional index structure. For a given query, we employ this index structure to find candidate matches from the database. We develop a new method for computing the statistical significance of these candidates. The candidates with high significance are then aligned to the query protein using the Smith-Waterman technique to find the optimal alignment. The experimental results show that our method can classify up to 97% of the superfamilies and up to 100% of the classes correctly according to the SCOP classification. Our method is up to 37 times faster than CTSS, a recent structure search technique, combined with Smith-Waterman technique for sequences.
Bhattacharya
A
A
Department of Computer Science, University of California, Santa Barbara, CA 93106, USA. arnab@cs.ucsb.edu
Can
T
T
Kahveci
T
T
Singh
A K
AK
Wang
Y F
YF
D000043:Abstracting and Indexing; D000595:Amino Acid Sequence; D019295:Computational Biology; D030562:Databases, Protein; D015394:Molecular Structure; D011506:Proteins / Q000737:chemistry* / Q000235:genetics*; D012984:Software
D011506:Proteins