Genetic Algorithm for Double Digest Problem
The strongly NP-complete Double Digest Problem (DDP) for physical mapping of DNA, is now used for efficient genotyping. An instance of DDP has multiple distinct solutions. Existing methods produce a single solution, and are slow for large instances. We employ a type of equivalence among the distinct solutions to obtain almost all of them. Our method comprises of first finding a solution from each equivalence class by an elitist genetic algorithm, and then generating entire classes. Notable efficiency was achieved due to significant reduction in search space.
KeywordsGenetic Algorithm Search Space Equivalence Class Valid Solution Distinct Solution
- 1.Bhandari, D., Murthy, C.A., Pal, S.K.: Genetic algorithm with elitist model and its convergence. International Journal of Pattern Recognition and Artificial Intelligence 10, 1147–1151 (1999)Google Scholar
- 2.Cieliebak, M., Eidenbenz, S., Woeginger, G.J.: Double digest revisited: Complexity and approximability in the presence of noisy data. Technical Report No. 382, ETH Zurich, Department of Computer Science (2002)Google Scholar
- 4.Goldberg, D.E.: Genetic Algorithm in Search, Optimization and Machine Learning. Addison-Wesley, Reading (1989)Google Scholar
- 6.Inglehart, J., Nelson, P.C.: On the limitations of automated restriction mapping. Computer Applications in the Biosciences (CABIOS) 10(3), 249–261 (1994)Google Scholar