Cargando…
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...
Autores principales: | Souza, Michael, Lavor, Carlile, Muritiba, Albert, Maculan, Nelson |
---|---|
Formato: | Online Artículo Texto |
Lenguaje: | English |
Publicado: |
BioMed Central
2013
|
Materias: | |
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 |
Ejemplares similares
-
Distance Geometry: Theory, Methods, and Applications
por: Mucherino, Antonio, et al.
Publicado: (2013) -
Euclidean distance geometry: an introduction
por: Liberti, Leo, et al.
Publicado: (2017) -
An introduction to distance geometry applied to molecular geometry
por: Lavor, Carlile, et al.
Publicado: (2017) -
An algorithm to enumerate all possible protein conformations verifying a set of distance constraints
por: Cassioli, Andrea, et al.
Publicado: (2015) -
A geometric algebra invitation to space-time physics, robotics and molecular geometry
por: Lavor, Carlile, et al.
Publicado: (2018)