CAVER:: a new tool to explore routes from protein clefts, pockets and cavities

被引:440
作者
Petrek, Martin
Otyepka, Michal
Banas, Pavel
Kosinova, Pavlina
Koca, Jaroslav
Damborsky, Jiri
机构
[1] Palacky Univ, Dept Phys Chem, Olomouc 77146, Czech Republic
[2] Palacky Univ, Ctr Biomol & Complex Mol Syst, Olomouc 77146, Czech Republic
[3] Masaryk Univ, Natl Ctr Biomol Res, Brno 62500, Czech Republic
[4] Masaryk Univ, Loschmidt Labs, Brno 62500, Czech Republic
关键词
D O I
10.1186/1471-2105-7-316
中图分类号
Q5 [生物化学];
学科分类号
071010 ; 081704 ;
摘要
Background: The main aim of this study was to develop and implement an algorithm for the rapid, accurate and automated identification of paths leading from buried protein clefts, pockets and cavities in dynamic and static protein structures to the outside solvent. Results: The algorithm to perform a skeleton search was based on a reciprocal distance function grid that was developed and implemented for the CAVER program. The program identifies and visualizes routes from the interior of the protein to the bulk solvent. CAVER was primarily developed for proteins, but the algorithm is sufficiently robust to allow the analysis of any molecular system, including nucleic acids or inorganic material. Calculations can be performed using discrete structures from crystallographic analysis and NMR experiments as well as with trajectories from molecular dynamics simulations. The fully functional program is available as a stand-alone version and as plug-in for the molecular modeling program PyMol. Additionally, selected functions are accessible in an online version. Conclusion: The algorithm developed automatically finds the path from a starting point located within the interior of a protein. The algorithm is sufficiently rapid and robust to enable routine analysis of molecular dynamics trajectories containing thousands of snapshots. The algorithm is based on reciprocal metrics and provides an easy method to find a centerline, i.e. the spine, of complicated objects such as a protein tunnel. It can also be applied to many other molecules. CAVER is freely available from the web site http://loschmidt.chemi.muni.cz/caver/.
引用
收藏
页数:9
相关论文
共 33 条
[1]   The Quickhull algorithm for convex hulls [J].
Barber, CB ;
Dobkin, DP ;
Huhdanpaa, H .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1996, 22 (04) :469-483
[2]  
Bellman R., 1958, Quarterly of Applied Mathematics, V16, P87, DOI [10.1090/qam/102435, DOI 10.1090/QAM/102435]
[3]   Penalized-distance volumetric skeleton algorithm [J].
Bitter, I ;
Kaufman, AE ;
Sato, M .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2001, 7 (03) :195-206
[4]  
Bitter I, 2000, RADIOLOGY, V217, P370
[5]   Acetylcholinesterase: Enhanced fluctuations and alternative routes to the active site in the complex with fasciculin-2 [J].
Bui, JM ;
Tai, K ;
McCammon, JA .
JOURNAL OF THE AMERICAN CHEMICAL SOCIETY, 2004, 126 (23) :7198-7205
[6]   Modification of activity and specificity of haloalkane dehalogenase from Sphingomonas paucimobilis UT26 by engineering of its entrance tunnel [J].
Chaloupková, R ;
Sykorová, J ;
Prokop, Z ;
Jesenská, A ;
Monincováa, M ;
Pavlová, M ;
Tsuda, M ;
Nagata, Y ;
Damborsky, J .
JOURNAL OF BIOLOGICAL CHEMISTRY, 2003, 278 (52) :52622-52628
[7]   Structure-specificity relationships for haloalkane dehalogenases [J].
Damborsky, J ;
Rorije, E ;
Jesenská, A ;
Nagata, Y ;
Klopman, G ;
Peijnenburg, WJGM .
ENVIRONMENTAL TOXICOLOGY AND CHEMISTRY, 2001, 20 (12) :2681-2689
[8]   The case for open-source software in drug discovery [J].
DeLano, WL .
DRUG DISCOVERY TODAY, 2005, 10 (03) :213-217
[9]  
Dijkstra E., 1959, NUMER MATH, V1, P83
[10]   ALGORITHM-97 - SHORTEST PATH [J].
FLOYD, RW .
COMMUNICATIONS OF THE ACM, 1962, 5 (06) :345-345