Suppr超能文献

基因片段重建算法。

An Algorithm for Gene Fragment Reconstruction.

机构信息

School of Sciences, Southwest Petroleum University, Chengdu, 610500, Sichuan, People's Republic of China.

School of Mathematics and Statistics, Southwest University, Chongqing, 400715, People's Republic of China.

出版信息

Interdiscip Sci. 2021 Mar;13(1):118-127. doi: 10.1007/s12539-021-00419-6. Epub 2021 Feb 20.

Abstract

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 片段的“拼图”过程。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/b816/7896547/6363fdca0c83/12539_2021_419_Fig1_HTML.jpg

文献AI研究员

20分钟写一篇综述,助力文献阅读效率提升50倍。

立即体验

用中文搜PubMed

大模型驱动的PubMed中文搜索引擎

马上搜索

文档翻译

学术文献翻译模型,支持多种主流文档格式。

立即体验