- BDCP00
- 
Amir Ben-Dor, Benny Chor, and Dan Pelleg.
 RHO - radiation hybrid ordering.
 Genome Research, 10:365-378, 2000.
- CLR90
- 
Thomas H. Cormen, Charles E. Leiserson, and Ronald L. Rivest.
 Introduction to algorithms.
 MIT Press, 1990.
 ISBN : 0-262-03141-8.
- DLR77
- 
A. P. Dempster, N. M. Laird, and D.B. Rubin.
 Maximum likelihood from incomplete data via the EM algorithm.
 J. R. Statistic. Soc. Ser. B, 39:1-38, 1977.
- Glo89
- 
F. Glover.
 Tabu search - part I.
 ORSA Journal on Computing, 1(3):190-206, Summer 1989.
- Glo90
- 
F. Glover.
 Tabu search - part II.
 ORSA Journal on Computing, 2(1):4-31, Winter 1990.
- Gol89
- 
D. Goldberg.
 Genetic Algorithms in Search, Optimization, and Machine
  Learning.
 Addison-Wesley Publishing Company, 1989.
- Gre88
- 
P. Green.
 Rapid construction of multilocus genetic linkage maps. i. maximum
  likelihood estimation.
 draft manuscript, 1988.
- Hel00
- 
K. Helsgaun.
 An effective implementation of the lin-kernighan traveling sal esman
  heuristic.
 European Journal of Operational Research, 126(1):106-130,
  2000.
 http://www.dat.ruc.dk/˜keld/research/LKH.
- LA84
- 
P. Van Laarhoven and E. Aarts.
 Simulated Annealing : Theory and Applications.
 D.Reidel Publishing Company, 1984.
- LBLC95
- 
Kathryn L. Lunetta, Michael Boehnke, Kenneth Lange, and David R. Cox.
 Experimental design and error detection for polyploid radiation
  hybrid mapping.
 Genome Research, 5:151-163, 1995.
- LGA+87
- 
E.S. Lander, P. Green, J. Abrahamson, A. Barlow, M. J. Daly, S. E. Lincoln, and
  L. Newburg.
 MAPMAKER: An interactive computer package for constructing primary
  genetic linkage maps of experimental and natural populations.
 Genomics, 1:174-181, 1987.
- LK73
- 
S. Lin and B.W. Kernighan.
 An effective heuristic algorithm for the traveling salesman pr oblem.
 Oper. Res., 21:498-516, 1973.
- SCBM01
- 
T. Schiex, P. Chabrier, M. Bouchez, and D. Milan.
 Boosting em for radiation hybrid and genetic mapping.
 In B. Moret, editor, Proc. of the first Workshop on Algorithms
  in Bioinformatics, volume 2149 of LNCS, pages 41-51. Springer Verlag,
  2001.
Thomas Schiex
2018-03-23