Papers 2011/08/18 17:38

The FALC-Loop web server for protein loop modeling


Junsu Ko, Dongseon Lee, Hahnbeom Park, Evangelos A. Coutsias, Julian Lee3,* and Chaok Seok1,*
Nucl. Acids Res. (2011) doi: 10.1093/nar/gkr352




The FALC-Loop web server provides an online interface for protein loop modeling by employing an ab initio loop modeling method called FALC (fragment assembly and analytical loop closure). The server may be used to construct loop regions in homology modeling, to refine unreliable loop regions in experimental structures or to model segments of designed sequences. The FALC method is computationally less expensive than typical ab initio methods because the conformational search space is effectively reduced by the use of fragments derived from a structure database. The analytical loop closure algorithm allows efficient search for loop conformations that fit into the protein framework starting from the fragment-assembled structures. The FALC method shows prediction accuracy comparable to other state-of-the-art loop modeling methods. Top-ranked model structures can be visualized on the web server, and an ensemble of loop structures can be downloaded for further analysis. The web server can be freely accessed at http://falc-loop.seoklab.org/.

크리에이티브 커먼즈 라이선스
Creative Commons License
Papers 2011/08/18 17:28

LigDockCSA: protein-ligand docking using conformational space annealing


Woong-Hee Shin, Lim Heo, Juyong Lee, Junsu Ko, Chaok Seok, Jooyoung Lee
[Journal Link]



Abstract

Protein–ligand docking techniques are one of the essential tools for structure-based drug design. Two major components of a successful docking program are an efficient search method and an accurate scoring function. In this work, a new docking method called LigDockCSA is developed by using a powerful global optimization technique, conformational space annealing (CSA), and a scoring function that combines the AutoDock energy and the piecewise linear potential (PLP) torsion energy. It is shown that the CSA search method can find lower energy binding poses than the Lamarckian genetic algorithm of AutoDock. However, lower-energy solutions CSA produced with the AutoDock energy were often less native-like. The loophole in the AutoDock energy was fixed by adding a torsional energy term, and the CSA search on the refined energy function is shown to improve the docking performance. The performance of LigDockCSA was tested on the Astex diverse set which consists of 85 protein–ligand complexes. LigDockCSA finds the best scoring poses within 2 Å root-mean-square deviation (RMSD) from the native structures for 84.7% of the test cases, compared to 81.7% for AutoDock and 80.5% for GOLD. The results improve further to 89.4% by incorporating the conformational entropy. © 2011 Wiley Periodicals, Inc. J Comput Chem, 2011
크리에이티브 커먼즈 라이선스
Creative Commons License
Papers 2011/08/18 17:26

A protein domain interaction interface database: InterPare


A protein domain interaction interface database: InterPare

Sungsam Gong, Changbum Park, Hansol Choi, Junsu Ko, Insoo Jang, Jungsul Lee, Dan M Bolser, Donghoon Oh, Deok-Soo Kim and Jong Bhak

BMC Bioinformatics 2005, 6:207



Background

Most proteins function by interacting with other molecules. Their interaction interfaces are highly conserved throughout evolution to avoid undesirable interactions that lead to fatal disorders in cells. Rational drug discovery includes computational methods to identify the interaction sites of lead compounds to the target molecules. Identifying and classifying protein interaction interfaces on a large scale can help researchers discover drug targets more efficiently.

Description

We introduce a large-scale protein domain interaction interface database called InterPare http://interpare.net webcite. It contains both inter-chain (between chains) interfaces and intra-chain (within chain) interfaces. InterPare uses three methods to detect interfaces: 1) the geometric distance method for checking the distance between atoms that belong to different domains, 2) Accessible Surface Area (ASA), a method for detecting the buried region of a protein that is detached from a solvent when forming multimers or complexes, and 3) the Voronoi diagram, a computational geometry method that uses a mathematical definition of interface regions. InterPare includes visualization tools to display protein interior, surface, and interaction interfaces. It also provides statistics such as the amino acid propensities of queried protein according to its interior, surface, and interface region. The atom coordinates that belong to interface, surface, and interior regions can be downloaded from the website.

Conclusion

InterPare is an open and public database server for protein interaction interface information. It contains the large-scale interface data for proteins whose 3D-structures are known. As of November 2004, there were 10,583 (Geometric distance), 10,431 (ASA), and 11,010 (Voronoi diagram) entries in the Protein Data Bank (PDB) containing interfaces, according to the above three methods. In the case of the geometric distance method, there are 31,620 inter-chain domain-domain interaction interfaces and 12,758 intra-chain domain-domain interfaces.


크리에이티브 커먼즈 라이선스
Creative Commons License
Papers 2011/08/18 17:20

Protein Motif Extraction via Feature Interval Selection

Journal of the Korean Data & Information Science Society
2006, Vol. 17, No 4, pp. 1279-1287


크리에이티브 커먼즈 라이선스
Creative Commons License
Papers 2011/07/07 11:48

Refinement of protein termini in template-based modeling using conformational space annealing


Hahnbeom Park, Junsu Ko, Keehyoung Joo, Julian Lee, Chaok Seok*, and Jooyoung Lee*


Keywords:
  • protein structure prediction
  • protein structure refinement
  • protein terminus modeling
  • CASP
  • fragment assembly



Abstract

The rapid increase in the number of experimentally determined protein structures in recent years enables us to obtain more reliable protein tertiary structure models than ever by template-based modeling. However, refinement of template-based models beyond the limit available from the best templates is still needed for understanding protein function in atomic detail. In this work, we develop a new method for protein terminus modeling that can be applied to refinement of models with unreliable terminus structures. The energy function for terminus modeling consists of both physics-based and knowledge-based potential terms with carefully optimized relative weights. Effective sampling of both the framework and terminus is performed using the conformational space annealing technique. This method has been tested on a set of termini derived from a non-redundant structure database and two sets of termini from the CASP8 targets. The performance of the terminus modeling method is significantly improved over our previous method that does not employ terminus refinement. It is also comparable or superior to the best server methods tested in CASP8. The success of the current approach suggests that similar strategy may be applied to other types of refinement problems such as loop modeling or secondary structure rearrangement. Proteins 2011

http://dx.doi.org/10.1002%2Fprot.23101
크리에이티브 커먼즈 라이선스
Creative Commons License