DocumentCode
2977527
Title
Finding protein active sites using approximate sub-graph isomorphism
Author
Dezfouli, Mohammad Ebrahim Abbasi ; Arab, Seyed Shahriar ; Fatemizadeh, Emad ; Hosseynimanesh, Najmeh
Author_Institution
Electr. Eng. Dept., Sharif Univ. of Technol., Tehran, Iran
fYear
2011
fDate
21-24 Feb. 2011
Firstpage
432
Lastpage
435
Abstract
Prediction of the amino acids that have a catalytic effect on the enzymes is a major stage in appointing the activity of the enzymes and classification. The biological activity of a protein usually depends on the existence of a small number of amino acids. Recently, many algorithms have been proposed in the literature for finding these amino acids which are complex and time consuming. In this paper, we will introduce a new method for predicting the active sites that will use the spatial coordinates and the type of amino acids that contain the active sites. In order to increase the speed we use an approximate graph isomorphism algorithm. Furthermore, this algorithm allows us to find several active sites for a protein and order them according to a RMSD (Root Mean Square Deviation) number which has several applications in biology.
Keywords
biology computing; enzymes; mean square error methods; molecular biophysics; molecular configurations; amino acids; graph isomorphism algorithm; protein active sites; root mean square deviation; subgraph isomorphism; Amino acids; Approximation algorithms; Classification algorithms; Databases; Protein engineering; Proteins;
fLanguage
English
Publisher
ieee
Conference_Titel
Biomedical Engineering (MECBME), 2011 1st Middle East Conference on
Conference_Location
Sharjah
Print_ISBN
978-1-4244-6998-7
Type
conf
DOI
10.1109/MECBME.2011.5752157
Filename
5752157
Link To Document