Solving the molecular distance geometry problem with inaccurate distance data

We present a new iterative algorithm for the molecular distance geometry problem with inaccurate and sparse data, which is based on the solution of linear systems, maximum cliques, and a minimization of nonlinear least-squares function. Computational results with real protein structures are presente...

Descripción completa

Detalles Bibliográficos
Autores principales: Souza, Michael, Lavor, Carlile, Muritiba, Albert, Maculan, Nelson
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2013
Materias:
Methodology Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3698034/
https://www.ncbi.nlm.nih.gov/pubmed/23901894
http://dx.doi.org/10.1186/1471-2105-14-S9-S7

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3698034/
https://www.ncbi.nlm.nih.gov/pubmed/23901894
http://dx.doi.org/10.1186/1471-2105-14-S9-S7

Ejemplares similares