Indexing protein structures using suffix trees.
Approaches for indexing proteins and fast and scalable searching for structures similar to a query structure have important applications such as protein structure and function prediction, protein classification and drug discovery. In this chapter, we describe a new method for extracting the local feature vectors of protein structures. Each residue is represented by a triangle, and the correlation between a set of residues is described by the distances between Calpha atoms and the angles between the normals of planes in which the triangles lie. The normalized local feature vectors are indexed using a suffix tree. For all query segments, suffix trees can be used effectively to retrieve the maximal matches, which are then chained to obtain alignments with database proteins. Similar proteins are selected by their alignment score against the query. Our results show classification accuracy up to 97.8 and 99.4% at the superfamily and class level according to the SCOP classification and show that on average 7.49 out of 10 proteins from the same superfamily are obtained among the top 10 matches. These results outperform the best previous methods.
Gao
Feng
F
Department of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, USA.
Zaki
Mohammed J
MJ
D000043:Abstracting and Indexing; D000465:Algorithms; D030562:Databases, Protein; D011487:Protein Conformation; D011506:Proteins / Q000737:chemistry
D011506:Proteins