Your browser doesn't support javascript.
An Algorithm for Gene Fragment Reconstruction.
Fang, Ningyuan; Wang, Kaifa; Tong, Dali.
  • Fang N; School of Sciences, Southwest Petroleum University, Chengdu, 610500, Sichuan, People's Republic of China.
  • Wang K; School of Mathematics and Statistics, Southwest University, Chongqing, 400715, People's Republic of China. kfwang72@163.com.
  • Tong D; Department of Urology, Daping Hospital, Army Medical University, Chongqing, 400042, People's Republic of China. tongdali1985@163.com.
Interdiscip Sci ; 13(1): 118-127, 2021 Mar.
Article in English | MEDLINE | ID: covidwho-1092007
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.
Subject(s)
Keywords

Full text: Available Collection: International databases Database: MEDLINE Main subject: Algorithms / Sequence Analysis, DNA Type of study: Experimental Studies / Randomized controlled trials Language: English Journal: Interdiscip Sci Journal subject: Biology Year: 2021 Document Type: Article

Similar

MEDLINE

...
LILACS

LIS


Full text: Available Collection: International databases Database: MEDLINE Main subject: Algorithms / Sequence Analysis, DNA Type of study: Experimental Studies / Randomized controlled trials Language: English Journal: Interdiscip Sci Journal subject: Biology Year: 2021 Document Type: Article