疫苗设计的最大n次覆盖率
Maximum n-times Coverage for Vaccine Design
摘要:
我们引入了最大$n$次覆盖问题,选择$k$覆盖,以最大限度地提高加权元素的总覆盖率,其中每个元素必须覆盖至少$n$次。我们还定义了最小成本的$n$倍覆盖问题,其目标是选择覆盖的最小集合,使得覆盖至少$n$倍的元素的权重之和至少为$τ$。最大$n$次覆盖问题是多集多覆盖问题的推广,是NP完全的,并且不是子模的。针对$n$ -次覆盖问题,提出了基于整数线性规划和序列贪婪优化的两种新的实用解决方案。我们表明,最大$n$倍覆盖率是构建肽疫苗设计的自然方式,并发现它产生的泛毒株COVID-19疫苗设计在预测的群体覆盖率和每个个体HLA分子显示的预期肽数方面优于其他29种已发表的设计。
英文摘要:
We introduce the maximum $n$-times coverage problem that selects $k$ overlays to maximize the summed coverage of weighted elements, where each element must be covered at least $n$ times. We also define the min-cost $n$-times coverage problem where the objective is to select the minimum set of overlays such that the sum of the weights of elements that are covered at least $n$ times is at least $τ$. Maximum $n$-times coverage is a generalization of the multi-set multi-cover problem, is NP-complete, and is not submodular. We introduce two new practical solutions for $n$-times coverage based on integer linear programming and sequential greedy optimization. We show that maximum $n$-times coverage is a natural way to frame peptide vaccine design, and find that it produces a pan-strain COVID-19 vaccine design that is superior to 29 other published designs in predicted population coverage and the expected number of peptides displayed by each individual's HLA molecules.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。