Literature DB >> 16854574

Side chain placement using estimation of distribution algorithms.

Roberto Santana1, Pedro Larrañaga, Jose A Lozano.   

Abstract

OBJECTIVE: This paper presents an algorithm for the solution of the side chain placement problem. METHODS AND MATERIALS: The algorithm combines the application of the Goldstein elimination criterion with the univariate marginal distribution algorithm (UMDA), which stochastically searches the space of possible solutions. The suitability of the algorithm to address the problem is investigated using a set of 425 proteins.
RESULTS: For a number of difficult instances where inference algorithms do not converge, it has been shown that UMDA is able to find better structures.
CONCLUSIONS: The results obtained show that the algorithm can achieve better structures than those obtained with other state-of-the-art methods like inference-based techniques. Additionally, a theoretical and empirical analysis of the computational cost of the algorithm introduced has been presented.

Entities:  

Mesh:

Substances:

Year:  2006        PMID: 16854574     DOI: 10.1016/j.artmed.2006.04.004

Source DB:  PubMed          Journal:  Artif Intell Med        ISSN: 0933-3657            Impact factor:   5.326


  3 in total

1.  OPUS-Rota: a fast and accurate method for side-chain modeling.

Authors:  Mingyang Lu; Athanasios D Dousis; Jianpeng Ma
Journal:  Protein Sci       Date:  2008-06-12       Impact factor: 6.725

Review 2.  Template-based protein modeling: recent methodological advances.

Authors:  Pankaj R Daga; Ronak Y Patel; Robert J Doerksen
Journal:  Curr Top Med Chem       Date:  2010       Impact factor: 3.295

3.  A review of estimation of distribution algorithms in bioinformatics.

Authors:  Rubén Armañanzas; Iñaki Inza; Roberto Santana; Yvan Saeys; Jose Luis Flores; Jose Antonio Lozano; Yves Van de Peer; Rosa Blanco; Víctor Robles; Concha Bielza; Pedro Larrañaga
Journal:  BioData Min       Date:  2008-09-11       Impact factor: 2.522

  3 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.