CARTAGENE: Constructing and Joining Maximum Likelihood Genetic Maps

Proceedings of the 5th International Conference on Intelligent Systems for Molecular Biology, ISMB 1997

Volumn , Issue , 1997, Pages 258-267

  Schiex, Thomas ^a   Gaspin, Christine ^a  

^a CEMAGREF   (France)

Author keywords

[No Author keywords available]

Indexed keywords

LOCAL SEARCH (OPTIMIZATION); MAPPING; TRAVELING SALESMAN PROBLEM;

GENETIC MAP; GENETIC MAPPING; LIKELIHOOD MAP; LOCAL SEARCH TECHNIQUES; MA XIMUM LIKELIHOODS; MAXIMUM-LIKELIHOOD; MULTI-POINTS; NEW APPROACHES; QUALITATIVE TRAIT LOCUS; QUANTITATIVE TRAIT LOCUS;

MAXIMUM LIKELIHOOD;

ALGORITHM; ANIMAL; ARTICLE; CHROMOSOME MAP; COMPARATIVE STUDY; COMPUTER PROGRAM; CROSS BREEDING; FEMALE; GENETIC MARKER; GENETICS; MALE; METHODOLOGY; QUANTITATIVE TRAIT; STATISTICAL ANALYSIS; STATISTICAL MODEL; STATISTICS; WASP;

ALGORITHMS; ANIMALS; CHROMOSOME MAPPING; CROSSES, GENETIC; DATA INTERPRETATION, STATISTICAL; FEMALE; GENETIC MARKERS; LIKELIHOOD FUNCTIONS; MALE; QUANTITATIVE TRAIT, HERITABLE; SOFTWARE; WASPS;

EID: 0030624026     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Applegate, D.; Bixby, R.; Chvátal, V.; and Cook, W. 1995. Finding cuts in the TSP (a preliminary report). Technical Report 95-05, DIMACS.
2. Buetow, K., and Chakravarti, A. 1987. Multipoint gene mapping using seriation. Am. J. Hum. Genet. 41; 180-201.
3. Cormen, T. H.; Leiserson, C. E.; and íüvest, R. L. 1990. Introduction to algorithms. NDT Press. ISBN: 0-262-03141-8.
4. Dempster, A.; Laird, N.; and Rubin, D. 1977. Maximum likelihood from incomplete data via the EM algorithm. J. R. Statist. Soc. Ser. 39:1-38.
5. Doerge, R. 1996. Constructing genetic maps by rapid chain delineation. Journal of Quantitative Trait Loci 2.
6. Echt, C; Knapp, S.; and Liu, B.-H. 1992. Genome mapping with non-inbred crosses using GMendel 2.0. Maize Genet. Coop. Newslett. 66:27-29.
7. Glover, F. 1989. Tabu search - part L ORSA Journal on Computing 1(3): 190-206.
8. Glover, F. 1990. Tabu search - part IL ORSA Journal on Computing liiy.Ą-il.
9. Goldberg, D. E. 1989. Genetic algorithms in Search, Optimization and Machine Learning. Addison-Wesley Pu-bishing Company.
10. Johnson, D. 1990. Local q)timization and the travebng salesman problem. In Proc. 17th Int. Colloquium on Automata, Languages and Programming, volume 443,446-461. Springer-Verlag Lectures Notes in Computer Science.
11. Lander, E. S., and Green, P. 1987. Construction of multi-locus genetic linkage maps in humans. Proc. Natl. Acad. Sci. USA 84:2363-2367.
12. Lander, E.; Green, P.; Abrahamson, J.; Barlow, A.; Daly, M. J.; Lincoln, S. E.; and Newburg, L. 1987. MAPMAKER: An interactive computer package for constructing primary genetic linkage maps of experimental and natural populations. Genomics 1:174-181.
13. Lathrop, G.; Lalcuel, J.; JuUer. C; and Ott, J. 1985. Multi-locus linkage analysis in humans: detection of linkage and estimation of recombination. Am. J. Hum. Genet. 37:482-488.
14. Laurent, v.; Vanlerberghe-Masutti,F.; Wajnberg.E.; Man-gin, B.; Schiex, T.; and Gaspin, C. 1997. Construction of a composite genetic map of the parasitoid wasp Trichogramma brassicae using RAPD informations from three populations. Submitted.
15. Lin, S., and Kemighan, B. W. 1973. An effective heuristic algorithm for the traveling salesman problem. Operation
16. Liu, B. H. 1995. The gene ordering problem, an analog of the traveling salesman problem. In Plant Genome 95.
17. Ott, L 1991. Analysis of human genetic linkage. Baltimore, Maryland: John Hopkins University Press, 2nd edition.
18. Stam, P. 1993. Constructing of integrated genetic linkage maps by means of a new computer package:JOINMAP. The Plant Journal 3(5):739-744.
19. Taillard, E. 1991. Robust taboo search for the quadratic assignment problem. Parallel computing 17:443-455.