Mapping DNA by stochastic relaxation: schedule for optimal annealing.
The analysis of the various cooling schedules for the simulated annealing algorithm is made towards the restriction map construction. Algorithm behaviour under control of three different cost functions is considered and the discrete cost function is found to handle successfully experimental data with realistic error sizes. A program using this function has been derived from the algorithm to construct linear and circular DNA maps.
Grigorjev
A V
AV
Department of Biotechnology, Institute for Genetics of Microorganisms, Moscow, USSR.
Mironov
A A
AA
D000465:Algorithms; D004247:DNA / Q000737:chemistry*; D015183:Restriction Mapping; D012984:Software
D004247:DNA