Mapping DNA by stochastic relaxation: Schedule for optimal annealing

A. V. Grigorjev, A. A. Mironov

Research output: Contribution to journalArticle

2 Scopus citations

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.

Original languageEnglish (US)
Pages (from-to)221-226
Number of pages6
JournalMitochondrial DNA
Volume1
Issue number4
DOIs
StatePublished - Jan 1 1991
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Genetics
  • Molecular Biology

Keywords

  • Computer program
  • DNA mapping
  • Simulated annealing

Fingerprint Dive into the research topics of 'Mapping DNA by stochastic relaxation: Schedule for optimal annealing'. Together they form a unique fingerprint.

  • Cite this