arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1010.1834cs.DMcs.CGq-bio.QM
收藏

可离散分子距离几何问题的解的个数

On the number of solutions of the discretizable molecular distance geometry problem

Leo Liberti, Benoit Masson, Jon Lee, Carlile Lavor, Antonio Mucherino

摘要:

广义离散分子距离几何问题是一个距离几何问题,可以用一种称为“分支-剪枝”的组合算法来求解。根据经验观察到,YES实例的解决方案的数量总是2的幂。我们证明了这个事件发生的概率为1。

英文摘要:

The Generalized Discretizable Molecular Distance Geometry Problem is a distance geometry problems that can be solved by a combinatorial algorithm called ``Branch-and-Prune''. It was observed empirically that the number of solutions of YES instances is always a power of two. We give a proof that this event happens with probability one.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑