Gene sequencing technology has been playing an important role in many aspects, such as life science, disease medicine and health medicine, particularly in the extremely tough process of fighting against 2019-novel coronavirus. Drawing DNA restriction map is a particularly important technology in genetic biology. The simplified partial digestion method (SPDP), a biological method, has been widely used to cut DNA molecules into DNA fragments and obtain the biological information of each fragment. In this work, we propose an algorithm based on 0–1 planning for the location of restriction sites on a DNA molecule, which is able to solve the problem of DNA fragment reconstruction just based on data of fragments’ length. Two specific examples are presented in detail. Furthermore, based on 1000 groups of original DNA sequences randomly generated, we define the coincidence rate and unique coincidence rate between the reconstructed DNA sequence and the original DNA sequence, and then analyze separately the effect of the number of fragments and the maximum length of DNA fragments on the coincidence rate and unique coincidence rate as defined. The effectiveness of the algorithm is proved. Besides, based on the existing optimization solution obtained, we simulate and discuss the influence of the error by computation method. It turns out that the error of position of one restriction site does not affect other restriction sites and errors of most restriction sites may lead to the failure of sequence reconstruction. Matlab 7.1 program is used to solve feasible solutions of the location of restriction sites, derive DNA fragment sequence and carry out the statistical analysis and error analysis. This paper focuses on basic computer algorithm implementation of rearrangement and sequencing rather than biochemical technology. The innovative application of the mathematical idea of 0–1 planning to DNA sequence mapping construction, to a certain extent, greatly simplifies the difficulty and complexity of calculation and accelerates the process of 'jigsaw' of DNA fragments.

基因测序技术在生命科学、疾病医学、健康医学等诸多领域发挥着重要作用，特别是在抗击2019新型冠状病毒的艰巨过程中发挥着重要作用。绘制 DNA 限制性图谱是遗传生物学中一项特别重要的技术。简化部分消化法(SPDP)是一种生物学方法，已被广泛用于将DNA分子切割成DNA片段，并获得每个片段的生物学信息。在这项工作中，我们提出了一种基于0-1规划DNA分子限制位点位置的算法，能够解决仅基于片段长度数据的DNA片段重建问题。详细介绍了两个具体的例子。此外，基于随机生成的 1000 组原始 DNA 序列，我们定义了重建的DNA序列和原始DNA序列的重合率和唯一重合率，然后分别分析了片段数和DNA片段最大长度对所定义的重合率和唯一重合率的影响。证明了算法的有效性。此外，在已有的优化解的基础上，我们通过计算方法模拟并讨论了误差的影响。事实证明，一个限制位点的位置错误不会影响其他限制位点，大多数限制位点的错误可能导致序列重建失败。Matlab 7.1程序用于求解限制性位点位置的可行解，推导DNA片段序列，进行统计分析和误差分析。本文侧重于重排和测序的基本计算机算法实现，而不是生化技术。将0-1规划的数学思想创新应用到DNA序列作图构建中，在一定程度上大大简化了计算的难度和复杂度，加速了DNA片段的“拼图”过程。