An algorithm to enumerate all possible protein conformations verifying a set of distance constraints

Background The determination of protein structures satisfying distance constraints is an important problem in structural biology. Whereas the most common method currently employed is simulated annealing, there have been other methods previously proposed in the literature. Most of them, however, are...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:BMC bioinformatics Ročník 16; číslo 1; s. 23
Hlavní autori: Cassioli, Andrea, Bardiaux, Benjamin, Bouvier, Guillaume, Mucherino, Antonio, Alves, Rafael, Liberti, Leo, Nilges, Michael, Lavor, Carlile, Malliavin, Thérèse E
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: London BioMed Central 28.01.2015
BioMed Central Ltd
Predmet:
Algorithms
Analysis
Biochemistry, Molecular Biology
Bioinformatics
Biomedical and Life Sciences
Computational Biology - methods
Computational Biology/Bioinformatics
Computer Appl. in Life Sciences
Computer Simulation
Humans
Life Sciences
Methodology
Methodology Article
Microarrays
Models, Molecular
Molecular biology
Peptide Fragments - chemistry
Protein Conformation
Proteins - chemistry
Molecular conformation
Distance geometry
Nuclear magnetic resonance
Branch-and-prune algorithm
Protein structure
branch-and-prune algorithm
Nuclear Magnetic Resonance 1 2
ISSN:1471-2105, 1471-2105
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Popis
Shrnutí:Background The determination of protein structures satisfying distance constraints is an important problem in structural biology. Whereas the most common method currently employed is simulated annealing, there have been other methods previously proposed in the literature. Most of them, however, are designed to find one solution only. Results In order to explore exhaustively the feasible conformational space, we propose here an interval Branch-and-Prune algorithm ( i BP) to solve the Distance Geometry Problem (DGP) associated to protein structure determination. This algorithm is based on a discretization of the problem obtained by recursively constructing a search space having the structure of a tree, and by verifying whether the generated atomic positions are feasible or not by making use of pruning devices. The pruning devices used here are directly related to features of protein conformations. Conclusions We described the new algorithm i BP to generate protein conformations satisfying distance constraints, that would potentially allows a systematic exploration of the conformational space. The algorithm i BP has been applied on three α -helical peptides.
Bibliografia:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1471-2105
1471-2105
DOI:10.1186/s12859-015-0451-1