Mapping DNA by stochastic relaxation: schedule for optimal annealing
- 1 January 1991
- journal article
- research article
- Published by Taylor & Francis in DNA Sequence
- Vol. 1 (4) , 221-226
- https://doi.org/10.3109/10425179109020776
Abstract
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.Keywords
This publication has 17 references indexed in Scilit:
- Crystallographic refinement by simulated annealingJournal of Molecular Biology, 1988
- Algorithms for the restriction-site mapping of DNA molecules.Proceedings of the National Academy of Sciences, 1988
- Drawing PedigreesMathematical Medicine and Biology: A Journal of the IMA, 1988
- Mapping DNA by stochastic relaxationAdvances in Applied Mathematics, 1987
- PMAP, PMAPS: DNA physical map constructing programsNucleic Acids Research, 1984
- Optimization by Simulated AnnealingScience, 1983
- Mapping the order of DNA restriction fragmentsGene, 1983
- Automatic construction of restriction site mapsNucleic Acids Research, 1982
- Inferring DNA structures from segmentation dataArtificial Intelligence, 1978
- Computer Solutions of the Traveling Salesman ProblemBell System Technical Journal, 1965