The protein side chain prediction is an essential issue, in protein structure prediction, protein design, and protein docking problems. The protein side chain packing problem has been proved to be NP-hard. Our method for solving this problem is first to reduce it to the clique finding problem, and then we can apply the Ant Colony Optimization (ACO) algorithm to solve it. In knowledge-based methods, the rotamers are chosen from the rotamer library, which are
based on the pair of dihedral angles, £r and £p, of backbones. We take the coordinate rotamer library as the template, so we do not need the complicated energy function to calculate the bond length and bond angle. We use a simple score function to evaluate the goodness of a solution of the ACO algorithm. The score function combines some factors, such as charge-charge interaction, intermolecular hydrogen bonds, disulfide bonds and van der Waals interactions. The experimental results show that our score function is biologically sensible. We compare our computational results with the results of SCWRL 3.0 and the
residue-rotamer-reduction (R3) algorithm. The accuracy
of our method outperforms both SCWRL 3.0 and R3 methods.
| Identifer | oai:union.ndltd.org:NSYSU/oai:NSYSU:etd-0830106-191348 |
| Date | 30 August 2006 |
| Creators | Hsin, Jing-Liang |
| Contributors | Bang-ye Wu, Chung-Lung Cho, Chia-ning Yang, Yow-ling Shiue, Chang-biau Yang |
| Publisher | NSYSU |
| Source Sets | NSYSU Electronic Thesis and Dissertation Archive |
| Language | English |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | http://etd.lib.nsysu.edu.tw/ETD-db/ETD-search/view_etd?URN=etd-0830106-191348 |
| Rights | off_campus_withheld, Copyright information available at source archive |
Page generated in 0.0019 seconds