ArticleInterdisciplinary sciences, computational life sciences2021
An Algorithm for Gene Fragment Reconstruction.
Article in Interdisciplinary sciences, computational life sciences, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.
What it found
Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.
The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.
The trial behind it
Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.
Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.
Who cites it
0 citing papers in PubMed.
No citing paper in PubMed yet.
Corrections and comments
PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.
Authors and funding
3 authors.
Funding
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.
Indexed as
Identifiers
What OpenQuestion holds
Registered trials
Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.