Title :
Using structural domains to predict obligate and non-obligate protein-protein interactions
Author :
Maleki, Mina ; Hall, Michael ; Rueda, Luis
Author_Institution :
Sch. of Comput. Sci., Univ. of Windsor, Windsor, ON, Canada
Abstract :
The identification and prediction of particular types of protein-protein interactions (PPIs) based on knowledge of their interacting domains is a problem that has drawn the attention of researchers in the past few years. We focus on the prediction and analysis of obligate and non-obligate complexes by using structural domains from the CATH database. Our proposed prediction model uses desolvation energies of domain-domain interactions (DDIs) present in the interfaces of such complexes. The prediction is performed via linear dimensionality reduction (LDR) and support vector machines (SVMs). Our results on two well-known datasets show that DDI features of the first three levels of CATH, especially level 2, are more powerful and discriminative than features of other levels in predicting these types of complexes. Furthermore, a detailed analysis shows that different DDIs are present in obligate and non-obligate complexes, and that homo-DDIs are more likely to be present in obligate interactions.
Keywords :
biology computing; molecular biophysics; molecular configurations; proteins; support vector machines; CATH database; SVM; domain-domain interactions; linear dimensionality reduction; nonobligate protein-protein interactions; obligate protein-protein interactions; structural domains; support vector machines; Accuracy; Amino acids; Kernel; Proteins; Support vector machines; Transient analysis; Vectors; CATH; complex type prediction; domain-domain interaction; protein-protein interaction;
Conference_Titel :
Computational Intelligence in Bioinformatics and Computational Biology (CIBCB), 2012 IEEE Symposium on
Conference_Location :
San Diego, CA
Print_ISBN :
978-1-4673-1190-8
DOI :
10.1109/CIBCB.2012.6217204