Skip Navigation

Bioinformatics 2005 21(Suppl 1):i116-i125; doi:10.1093/bioinformatics/bti1017
This Article
Right arrow FREE Full Text (Print PDF) Freely available
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Cortés, J.
Right arrow Articles by Tran, V.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Cortés, J.
Right arrow Articles by Tran, V.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author 2005. Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions{at}oupjournals.org

A path planning approach for computing large-amplitude motions of flexible molecules

J. Cortés 1, T. Siméon 1,*, V. Ruiz de Angulo 2, D. Guieysse 3, M. Remaud-Siméon 3 and V. Tran 4

1LAAS-CNRS 7 av. du Colonel-Roche, 31077 Toulouse, France
2Institut de Robòtica i Informàtica Industrial, CSIC-UPC Llorens Artigás 4–6, 2 planta, 08028 Barcelona, Spain
3Laboratoire Biotechnologie-Bioprocédés UMR CNRS 5504, UMR INRA 792, INSA, 135 av. de Rangueil, 31077 Toulouse, France
4Unité Biotechnologie, Biocatalyse, Biorégulation (U3B) UMR CNRS 6204, Faculté des Sciences et Techniques, 2 rue de la Houssinière, 44322 Nantes, France

*To whom correspondence should be addressed.

Motivation: Motion is inherent in molecular interactions. Molecular flexibility must be taken into account in order to develop accurate computational techniques for predicting interactions. Energy-based methods currently used in molecular modeling (i.e. molecular dynamics, Monte Carlo algorithms) are, in practice, only able to compute local motions while accounting for molecular flexibility. However, large-amplitude motions often occur in biological processes. We investigate the application of geometric path planning algorithms to compute such large motions in flexible molecular models. Our purpose is to exploit the efficacy of a geometric conformational search as a filtering stage before subsequent energy refinements.

Results: In this paper two kinds of large-amplitude motion are treated: protein loop conformational changes (involving protein backbone flexibility) and ligand trajectories to deep active sites in proteins (involving ligand and protein side-chain flexibility). First studies performed using our two-stage approach (geometric search followed by energy refinements) show that, compared to classical molecular modeling methods, quite similar results can be obtained with a performance gain of several orders of magnitude. Furthermore, our results also indicate that the geometric stage can provide highly valuable information to biologists.

Availability: The algorithms have been implemented in the general-purpose motion planning software Move3D, developed at LAAS-CNRS. We are currently working on an optimized stand-alone library that will be available to the scientific community.

Contact: nic{at}laas.fr


Received on January 15, 2005; accepted on March 27, 2005

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BioinformaticsHome page
A. Enosh, S. J. Fleishman, N. Ben-Tal, and D. Halperin
Prediction and simulation of motion in pairs of transmembrane {alpha}-helices
Bioinformatics, January 15, 2007; 23(2): e212 - e218.
[Abstract] [Full Text] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.