Rapid Protein Side-Chain Packing via Tree Decomposition

This paper proposes a novel tree decomposition based side-chain assignment algorithm, which can obtain the globally optimal solution of the side-chain packing problem very efficiently. Theoretically, the computational complexity of this algorithm is O((N + M)ntw+1 rot ) where N is the number of residues in the protein, M the number of interacting residue pairs, nrot the average number of rotamers for each residue and tw(= O(N 2 3 log N)) the tree width of the residue interaction graph. Based on this algorithm, we have developed a side-chain prediction program SCATD (Side Chain Assignment via Tree Decomposition). Experimental results show that after the Goldstein DEE is conducted, nrot is around 3.5, tw is only 3 or 4 for most of the test proteins in the SCWRL benchmark and less than 10 for all the test proteins. SCATD runs up to 90 times faster than SCWRL 3.0 on some large proteins in the SCWRL benchmark and achieves an average of five times faster speed on all the test proteins. If on...

• Type: Conference
• Year: 2005
• Where: RECOMB
• Authors: Jinbo Xu
• Keywords: Computational Biology, Globally Optimal Solution, RECOMB 2005, Side Chain Assignment, Test Proteins