Mapping DNA by stochastic relaxation: a new approach to fragment sizes
Department of Biotechnology, Institute for Genetics of Microorganisms 1-st Dorozhny pr. 1, Moscow 113545. USSR
Instead of the traditional manipulations with given fixed fragment lengths in the restriction map construction a method of varying the lengths is proposed and realized under the simulated annealing algorithm scheme. The described approach has no upper limit on the number of fragments mapped with even ordinary hardware. A program has been derived from the algorithm combined with the leastsquares refinement procedure for both linear and circular maps. The algorithm's abilily to pick up missed maps is illustrated and the problem of reducing the number of solutions is discussed.
Received on January 8, 1990; accepted on January 9, 1990