DocumentCode :
2556429
Title :
Prediction β-hairpin motifs in enzyme protein using three methods
Author :
Long, Haixia ; Hu, Xiuzhen
Author_Institution :
Coll. of Sci., Inner Mongolia Univ. of Technol., Hohhot, China
fYear :
2012
fDate :
29-31 May 2012
Firstpage :
570
Lastpage :
574
Abstract :
The authors use three methods, including matrix scoring algorithm, increment of diversity algorithm and Random Forest algorithm. They are used to predict β-hairpin motifs in the ArchDB-EC and ArchDB40 dataset. In the ArchDB-EC dataset, we obtain the accuracy of 68.5%, 79.8% and 84.3%, respectively. Matthew´s correlation coefficient are 0.17, 0.61 and 0.63, respectively. Using same three methods in the ArchDB40 dataset, we obtain the accuracy and Matthew´s correlation coefficient of 67.9% and 0.39, 75.2% and 0.51, 83.5% and 0.60, respectively. Experiments show that Random Forest algorithm for predicting β-hairpin motifs is best and the predictive results in ArchDB40 dataset are better than previous results.
Keywords :
bioinformatics; data analysis; enzymes; matrix algebra; random processes; trees (mathematics); ArchDB-EC dataset; ArchDB40 dataset; Matthew correlation coefficient; diversity algorithm; enzyme protein; matrix scoring algorithm; prediction β-hairpin motifs; random forest algorithm; Accuracy; Amino acids; Correlation; Diversity methods; Prediction algorithms; Proteins; Support vector machines; β-Hairpin motif; Amino acid flexibility value; Increment of diversity algorithm; Matrix scoring algorithm; Predicted secondary structure information; Random forest algorithm;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Natural Computation (ICNC), 2012 Eighth International Conference on
Conference_Location :
Chongqing
ISSN :
2157-9555
Print_ISBN :
978-1-4577-2130-4
Type :
conf
DOI :
10.1109/ICNC.2012.6234521
Filename :
6234521
Link To Document :
بازگشت