Quantum Inspired Genetic Algorithm for Double Digest Problem

The double digest problem (DDP) is a fundamental problem in bioinformatics, and it has been proven to be an NP-hard problem. As a type of promising combinational optimization method inspired by evolutionary theory, genetic algorithms have attracted much attention during the past four decades, and some genetic algorithms have been successfully applied to solve the DDP. To further enhance the ability to solve the DDP, it is of interest to couple the insights from classical genetic algorithms with the parallel capability of quantum computation. Thus, in this paper, we propose a quantum inspired genetic algorithm (QIGA) for the DDP. In our QIGA, the binary Q-bit representation is converted to mapping sequences, and on this basis, DNA fragments are reordered. The solution of the DDP is a permutation, selected by the QIGA, of all the DNA fragments. The effectiveness and efficiency of our proposal can be inferred from the simulation results for the QIGA on a classical computer. As far as we know, this is the first attempt to address the DDP using a QIGA. Compared with classical genetic algorithms for the DDP, our QIGA slightly accelerates the time require to solve the problem, and we believe that it will achieve superior performance when a quantum computer with the required scale is available.

[1]  Siddhartha Bhattacharyya,et al.  An improved Hybrid Quantum-Inspired Genetic Algorithm (HQIGA) for scheduling of real-time task in multiprocessor system , 2017, Appl. Soft Comput..

[2]  Ming-Yang Kao,et al.  The Enhanced Double Digest Problem for DNA Physical Mapping , 2003, J. Comb. Optim..

[3]  Mark Stefik,et al.  Inferring DNA Structures from Segmentation Data , 1978, Artif. Intell..

[4]  Mohammad Ganjtabesh,et al.  Genetic algorithm solution for double digest problem , 2012, Bioinformation.

[5]  Siddhartha Bhattacharyya,et al.  A Multi-Objective Quantum-Inspired Genetic Algorithm (Mo-QIGA) for Real-Time Tasks Scheduling in Multiprocessor Environment , 2018 .

[6]  Lixiang Li,et al.  DDmap: a MATLAB package for the double digest problem using multiple genetic operators , 2019, BMC Bioinformatics.

[7]  Jie Guo,et al.  Real-Coded Quantum-Inspired Genetic Algorithm-Based BP Neural Network Algorithm , 2015 .

[8]  M. Waterman,et al.  Multiple solutions of DNA restriction mapping problems , 1991 .

[9]  C. A. Murthy,et al.  Genetic Algorithm for Double Digest Problem , 2005, PReMI.

[10]  H. Smith,et al.  Restriction endonucleases in the analysis and restructuring of dna molecules. , 1975, Annual review of biochemistry.

[11]  Ling Wang,et al.  A Hybrid Quantum-Inspired Genetic Algorithm for Multiobjective Flow Shop Scheduling , 2007, IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics).

[12]  Jian Zhang,et al.  A Quantum‐Inspired Genetic Algorithm‐Based Optimization Method for Mobile Impact Test Data Integration , 2018, Comput. Aided Civ. Infrastructure Eng..

[13]  James C. Bean,et al.  Genetic Algorithms and Random Keys for Sequencing and Optimization , 1994, INFORMS J. Comput..

[14]  Ling Wang,et al.  Order-based genetic algorithm for flow shop scheduling , 2002, Proceedings. International Conference on Machine Learning and Cybernetics.

[15]  H. Smith,et al.  A restriction enzyme from Hemophilus influenzae. I. Purification and general properties. , 1970, Journal of molecular biology.

[16]  Enrico Blanzieri,et al.  Quantum Genetic Optimization , 2008, IEEE Transactions on Evolutionary Computation.

[17]  M. Waterman,et al.  Mapping DNA by stochastic relaxation , 1987 .

[18]  Y. Zhang,et al.  Solving large double digestion problems for DNA restriction mapping by using branch-and-bound integer linear programming , 2008, Int. J. Bioinform. Res. Appl..

[19]  Ajit Narayanan,et al.  Quantum-inspired genetic algorithms , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[20]  Ling Wang,et al.  Genetic ordinal optimization for stochastic traveling salesman problem , 2004, Fifth World Congress on Intelligent Control and Automation (IEEE Cat. No.04EX788).

[21]  H. Smith,et al.  A restriction enzyme from Hemophilus influenzae. II. , 1970, Journal of molecular biology.

[22]  Gilles Brassard,et al.  Tight bounds on quantum searching , 1996, quant-ph/9605034.

[23]  Pavel A. Pevzner,et al.  DNA physical mapping and alternating Eulerian cycles in colored graphs , 1995, Algorithmica.

[24]  Jong-Hwan Kim,et al.  Genetic quantum algorithm and its application to combinatorial optimization problem , 2000, Proceedings of the 2000 Congress on Evolutionary Computation. CEC00 (Cat. No.00TH8512).