Mapping DNA by stochastic relaxation: a new approach to fragment sizes

Instead of the traditional manipulations with given fixed fragmentlengths in the restriction map construction a method of varyingthe lengths is proposed and realized under the simulated annealingalgorithm scheme. The described approach has no upper limiton the number of fragments mapped with even ordinary hardware.A program has been derived from the algorithm combined withthe least–squares refinement procedure for both linearand circular maps. The algorithm's abilily to pick up missedmaps is illustrated and the problem of reducing the number ofsolutions is discussed. Received on January 8, 1990; accepted on January 9, 1990