title: Solving the molecular distance geometry problem with inaccurate distance data.
abstract: 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 presented in order to validate our approach.
authors.affiliation: Department of Statistics and Applied Mathematics, Federal University of Ceará, Ceará, 60455-760, Brazil. michael@ufc.br
authors.forename: Michael
authors.initials: M
authors.lastname: Souza
authors.forename: Carlile
authors.initials: C
authors.lastname: Lavor
authors.forename: Albert
authors.initials: A
authors.lastname: Muritiba
authors.forename: Nelson
authors.initials: N
authors.lastname: Maculan
mesh_terms: D000465:Algorithms; D019295:Computational Biology / Q000379:methods*; D016018:Least-Squares Analysis; D008958:Models, Molecular; D017711:Nonlinear Dynamics; D011506:Proteins / Q000737:chemistry*
chemical_list: D011506:Proteins
references.citation: Nucleic Acids Res. 2000 Jan 1;28(1):235-42
references.pmid: 10592235
references.citation: Bull Math Biol. 2009 Nov;71(8):1914-33
references.pmid: 19533250
references.citation: Biochemistry. 1994 Jun 28;33(25):7768-78
references.pmid: 8011642
references.citation: Proc Natl Acad Sci U S A. 1994 Mar 15;91(6):2071-5
references.pmid: 8134350