Reconstructing sets from interpoint distances (extended abstract)
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms and Manufacturing Systems Design
Genetic Algorithms and Manufacturing Systems Design
The restriction mapping problem revisited
Journal of Computer and System Sciences - Computational biology 2002
Open Combinatorial Problems in computational Molecular Biology
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
| Hi-index | 0.00 |
One of the fundamental problems in computational biology is the construction of physical maps of chromosomes from the hybridisation experiments between unique probes and clones of chromosome fragments. Before introducing the shotgun sequencing method, Partial Digest Problem PDP was an intractable problem used to construct the physical maps of DNA sequence in molecular biology. In this paper, we develop a novel Genetic Algorithm GA for solving the PDP. This algorithm is implemented and compared with well-known existing algorithms on different types of random and real instances data, and the obtained results show the efficiency of our algorithm. Also, our GA is adapted to handle the erroneous data and their efficiency is presented for the large instances of this problem.