One aspect of the molecular distance geometry problem (MDGP) described in this PDF, can be written as follows:

"Given observations of noisy distances between atoms in a molecule, estimate the values of the true distances."

More formally: Given the datasets $\mathcal{D}_1,\mathcal{D}_2,\dots,\mathcal{D}_n$ of noisy distances for the atoms defined by the points $\mathcal{S} = \{x_1,x_2,\dots,x_n\}$, estimate the $n \times n$ symmetric distance matrix $\mathbf{A} = (d_{ij})$, where $d_{ij} = \lvert\lvert x_i - x_j\rvert\rvert$ and $x_i \in \mathbb{R}^K$ for $i,j \in \{1,2,...,n\}$.

Are there references that explore different noise models for the distances between atoms and references that attempt to estimate these distances?

  • $\begingroup$ +1. Welcome to our new community, and thank you for contributing your question here!! We hope to see much more of you in the future! I had to comment out your description of the 2nd MDGP sub-problem, because your overall question has nothing to do with it, so it was just distracting. If you have questions about it, you can ask it separately (and by the way, the 2nd sub-problem can be solved by MDS and the dozens of related methods. Also there's 59 references in the PDF you gave in the question, what's wrong with those? What's your goal? $\endgroup$ Jun 28 at 3:22
  • $\begingroup$ @NikeDattani thanks for your comment. All distance geometry algorithms use a cost function. My goal is to compare the performance of these algorithms when the cost function matches the distribution of the distances, and when there is a mismatch. For example, if the distances are Gaussian distributed, then using the sum of squared errors cost function will yield optimal distance estimates, in the sense that they maximize the corresponding likelihood function. Similarly, if the distances are Laplace distributed, then using the sum of absolute errors cost function will be optimal... $\endgroup$
    – mhdadk
    Jun 28 at 11:22
  • $\begingroup$ @NikeDattani ...In the literature, I have found that most algorithms use the sum of squared errors cost function, regardless of the distribution of the distances. Has anyone explored using the appropriate cost function based on the distribution of distances before? $\endgroup$
    – mhdadk
    Jun 28 at 11:24

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.