OPTIMIZATION OF MODELING IMMOBILIZED PROTEIN INTERACTIONS ON COMPULATIONAL CLUSTERS WITH THE SUPPLYING OF ACCESS TO THE ALGORITHM VIA WEB-INTERFACE

Authors

  • Kirill V. Romanenkov Lomonosov Moscow State University (Moscow, Russian Federation)
  • Aleksey N. Salnikov Lomonosov Moscow State University (Moscow, Russian Federation)

DOI:

https://doi.org/10.14529/cmse140105

Keywords:

bioinformatics, multiprocessor systems, immobilized protein interactions, parallel algorithms, stochastic algorithms

Abstract

In this work were introduced parallel versions based on OpenMP and MPI technologies of sequential program for modeling immobilized protein interactions. Both versions have shown good scalability and better time indices to compare with the sequential version when running on single processor. Need to mention that modeling of immobilized protein interactions for some compounds have taken more than twenty hours of computations on several hundreds of processors, that is why for such modeling tasks with the great quantity of positions availability of nondeterministic algorithms, providing biologically correct result in reasonable time, seems to be rather important. Selection of stochastic algorithms has proved its value: both Monte-Carlo and simulated bee colony algorithms had found conformation corresponding minimal energy state. Supplying of access to the algorithm via web-interface measures up modern specifications of remote computations and allows the wide circle of specialists use computational power of Moscow State University and, taking into account extending the sphere of application tasks of molecular simulation, the presence of open web-interface providing remote access to the computational clusters is quite an important task.

Author Biographies

Kirill V. Romanenkov, Lomonosov Moscow State University (Moscow, Russian Federation)

аспирант кафедры суперкомпьютеров и квантовой
информатики факультета Вычислительной математики и кибернетики

Aleksey N. Salnikov, Lomonosov Moscow State University (Moscow, Russian Federation)

к.ф.-м.н., старший научный сотрудник факультета
Вычислительной математики и кибернетики

References

Fortenberry, C. Exploring Symmetry as an Avenue to the Computational Design of Large Protein Domains / C. Fortenberry, E.A. Bowman, W. Proffitt, B. Dorr, S. Combs, J. Harp, L. Mizoue, J. Meiler // Journal of the American Chemical Society. — 2011. — Vol. 133, No. 45. — P. 18026–18029.

Wernisch, L. Automatic protein design with all atom force-fields by exact and heuristic optimization / L. Wernisch, S. Hery, S.J. Wodak // Journal of Molecular Biology. — 2000. — Vol. 301, No. 3. — P. 713–736.

Leach, A.R. Exploring the conformational space of protein side chains using dead-end elimination and the A* algorithm / A.R. Leach, A.P. Lemon // Proteins: Structure, Function, and Bioinformatics. — 1998. — Vol. 33, No. 2. — P. 227–239.

Tantar, A.A. A parallel hybrid genetic algorithm for protein structure prediction on the computational grid / A.A. Tantar, N. Melab, E.G. Talbi, B. Parent, D. Horvath // Future Generation Comp. Syst. — 2009. — Vol. 23, No. 3. — P. 398–409.

Pitman, D.J. Improving computational efficiency and tractability of protein design using a piecemeal approach. A strategy for parallel and distributed protein design. — Bioinformatics. — 2013. / D.J. Pitman, C.D. Schenkelberg, Y.M. Huang, F.D. Teets, D. DiTursi, C. Bystroff. URL:http://dx.doi.org/10.1093/bioinformatics/btt735 (дата обращения: 30.12.2013).

Molto, G. Protein design based on parallel dimensional reduction / G. Molto, M. Suarez, P. Tortosa, J.M. Alonso, V. Hernandez, A. Jaramillo // Journal of Chemical Information and Modeling. — 2009. — Vol. 49, No. 5. — P. 1261–1271.

Street, A.G. Computational protein design / A.G. Street, S.L. Mayo. URL: http://dx.doi.org/10.1016/S0969-2126(99)80062-8 (дата обращения: 24.02.2013).

Voigt, C.A. Trading accuracy for speed: A quantitative comparison of search algorithms in protein sequence design / C.A. Voigt, D.B. Gordon, S.L. Mayo // Journal of Molecular Biology. — 2000. — Vol. 299, No. 3. — P. 789–803.

Pham, D.T. The Bees Algorithm — A Novel Tool for Complex Optimisation Problems / D.T. Pham, A. Ghanbarzadeh, E. Koc, S. Otri, S. Rahim, M. Zaidi // 2nd International Virtual Conference on Intelligent Production Machines and Systems (IPROMS’2006) — 2006. — P. 454–461.

Hamers-Casterman, C. Naturally occurring antibodies devoid of light chains / C. Hamers Casterman, T. Atarhouch, S. Muyldermans, G. Robinson, C. Hamers, E.B. Songa, N. Bendahman, R. Hamers // Nature. — 1993. — Vol. 363. — P. 446–448.

Revets, H. Nanobodies as novel agents for cancer therapy / H. Revets, P. De Baetselier, S. Muyldermans // Expert Opinion on Biological Therapy. — 2005. — Vol. 5, No. 1. — P. 111–124.

Grishin, A. Bioinformatics analysis of LAGLIDADG homing endonucleases for construction of enzymes with changed DNA recognition specificity / A. Grishin, I. Fonfara, W. Wende, D. Alexeyevsky, A. Alexeyevsky, S. Spirin, O. Zanegina, A. Karyagina // 4-th Moscow

Conference on Computational Molecular Biology. — Moscow, MSU, 2009. — P. 123.

Князев, Н. А. Система справедливого планирования и унифицированного запуска задач пользователя на суперкомпьютерах / Н.А. Князев, А.Н. Сальников // Параллельные вычислительные технологии ПаВТ’2010): Труды международной научной конференции (Уфа, 29 марта – 2 апреля 2010 г.). — Челябинск: Издательский центр ЮУрГУ, 2010. — C. 665–666.

Сальников, А.Н. Интернет-cервис для построения множественного выравнивания последовательностей на многопроцессорных системах, созданный на основе data-flow модификации алгоритма MUSCLE / А.Н. Сальников // Параллельные вычислительные технологии (ПАВТ’2009): Труды международной научной конференции (Нижний Новгород, 30 марта – 3 апреля 2009 г.). — Челябинск: издательский центр ЮурГУ, 2009. — С. 680–687.

Published

2014-04-24

Issue

Section

Informatics, Computers and Control