Department of Statistics and Applied Mathematics, Federal University of Ceará, Ceará, 60455-760, Brazil.
BMC Bioinformatics. 2013;14 Suppl 9(Suppl 9):S7. doi: 10.1186/1471-2105-14-S9-S7. Epub 2013 Jun 28.
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.
我们提出了一种新的迭代算法,用于解决存在不准确和稀疏数据的分子距离几何问题,该算法基于线性系统的求解、最大团的求解和非线性最小二乘函数的最小化。为了验证我们的方法,我们给出了使用真实蛋白质结构的计算结果。