Abstract
Constructing genetic maps is a prerequisite for most in-depth genetic studies of an organism. The problem of constructing reliable genetic maps for any organism can be considered as a complex optimization problem with both discrete and continuous parameters. This paper shows how genetic algorithms can been used to tackle this problem on simple pedigree. The approach is embodied in an hybrid algorithm that relies on the statistical optimization algorithm EM to handle the continuous variables while genetic algorithms handle the discrete side. The efficiency of the approach lies critically in the introduction of greedy local search in the fitness evaluation of the genetic algorithm, using a neighborhood structure which has been inspired by an analogy between the marker ordering problem and a variant of the famous traveling salesman problem. This shows how genetic algorithms can easily benefit from existing efficient neighborhood structures developed for local search algorithms. The resulting program, called CARWAGENE, has been applied both to real data, from a small parasitoid wasp, and simulated data. In both cases, it compares quite favorably to existing packages.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Applegate (D.), Bixby (R.), Chvátal (V.) et Cook (W.).-Finding cuts in the TSP (a preliminary report).-Technical Report 95–05, DIMACS, March 1995.
Cormen (Thomas H.), Leiserson (Charles E.) et Rivest (Ronald L.).-Introduction to algorithms.-MIT Press, 1990. ISBN: 0-262-03141-8.
Dempster (A.P.), Laird (N.M.) et Rubin (D.B.).-Maximum likelihood from incomplete data via the EM algorithm. J. R. Statist. Soc. Ser., vol. 39, 1977, pp. 1–38.
Glover (F.).-Tabu search-part I. ORSA Journal on Computing, vol. 1 (3), Summer 1989, pp. 190–206.
Glover (F.).-Tabu search-part II. ORSA Journal on Computing, vol. 2 (1), Winter 1990, pp. 4–31.
Goldberg (D. E.).-Genetic algorithms in Search, Optimization and Machine Learning.-Addison-Wesley Pubishing Company, 1989.
Lander (E.S.), Green (P.), Abrahamson (J.), Barlow (A.), Daly (M. J.), Lincoln (S. E.) et Newburg (L.).-MAPMAKER: An interactive computer package for constructing primary genetic link age maps of experimental and natural populations. Genomics, vol. 1, 1987, pp. 174–181.
Lathrop (G.M.), Lalouel (J.M.), Julier (C.) et Ott (J.).-Multilocus linkage analysis in humans: detection of linkage and estimation of recombination. Am. J. Hum. Genet., vol. 37, 1985, pp. 482–488.
Laurent (V.), Vanlerberghe-Masutti (F.), Wajnberg (E.), Mangin (B.), Schiex (T.) et Gaspin (C.).-Construction of a composite genetic map of the parasitoid wasp trichogramma brassicae using RAPD informations from three populations. Submitted.
Lin (S.) et Kernighan (B. W.).-An effective heuristic algorithm for the traveling salesman problem. Operation Research, vol. 21, 1973, pp. 498–516.
Liu (B. H.).-The gene ordering problem, an analog of the traveling salesman problem. In: Plant Genome 95.
Schiex (T.) et Gaspin (C.).-Cartagene: Constructing and joining maximum likelihood genetic maps. In: Proceedings of the fifth international conference on Intelligent Systems for Molecular Biology.-Porto Carras, Halkidiki, Greece, 1997. Available at http://www-bia.inra.fr/T/schiex.
Stam (P.).-Constructing of integrated genetic linkage maps by means of a new computer package: JOINMAP. The Plant Journal, vol. 3 (5), 1993, pp. 739–744.
Taillard (E.).-Robust taboo search for the quadratic assignment problem. Parallel computing, vol. 17, 1991, pp. 443–455.
Telfar (G.).-Generally Applicable Heuristics for Global Optimization: An Investigation of Algorithm Performance for the Euclidean TSP.-Master's thesis, Victoria University of Wellington, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaspin, C., Schiex, T. (1998). Genetic algorithms for genetic mapping. In: Hao, JK., Lutton, E., Ronald, E., Schoenauer, M., Snyers, D. (eds) Artificial Evolution. AE 1997. Lecture Notes in Computer Science, vol 1363. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0026597
Download citation
DOI: https://doi.org/10.1007/BFb0026597
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64169-8
Online ISBN: 978-3-540-69698-8
eBook Packages: Springer Book Archive