离散Fréchet距离下蛋白质局部结构比对的复杂性
On the Complexity of Protein Local Structure Alignment Under the Discrete Fréchet Distance
摘要:
我们发现,给定$m$蛋白质(或蛋白质骨架,其被建模为每个长度为O(n)的3D多边形链),离散Fréchet距离下的蛋白质局部结构对齐问题与独立集一样困难。因此,该问题不允许因子$n^{1-ε}$的任何近似。这是关于蛋白质局部结构排列问题的最强否定结果。另一方面,如果$m$是一个常数,那么问题可以在多项式时间内解决。
英文摘要:
We show that given $m$ proteins (or protein backbones, which are modeled as 3D polygonal chains each of length O(n)) the problem of protein local structure alignment under the discrete Fréchet distance is as hard as Independent Set. So the problem does not admit any approximation of factor $n^{1-ε}$. This is the strongest negative result regarding the protein local structure alignment problem. On the other hand, if $m$ is a constant, then the problem can be solved in polygnomial time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。