Related Experiment Video
Updated: May 21, 2026

A Universal Protocol for Large-scale gRNA Library Production from any DNA Source
Published on: December 6, 2017
Genetic algorithm solution for double digest problem
Abstract:
The strongly NP-Hard Double Digest Problem, for reconstructing the physical map of DNA sequence, in now using for efficient genotyping. Most of the existing methods are inefficient in tackling large instances due to the large search space for the problem which grows as a factorial function (a!)(b!) of the numbers a and b of the DNA fragments generated by the two restriction enzymes. Also, none of the existing methods are able to handle the erroneous data. In this paper, we develop a novel method based on genetic algorithm for solving this problem and it is adapted to handle the erroneous data. Our genetic algorithm is implemented and compared with the other well-known existing algorithms. The obtained results show the efficiency (speedup) of our algorithm with respect to the other methods, specially for erroneous data.
Related Concept Videos
DNA Isolation
Maxam-Gilbert Sequencing
Challenges of the Maxam-Gilbert Method
The...
Gene Conversion
Sanger Sequencing
