Mapping DNA by stochastic relaxation

DOI10.1016/0196-8858(87)90013-3zbMath0638.92005OpenAlexW2059127308MaRDI QIDQ1099802

Michael S. Waterman, Larry Goldstein

Publication date: 1987

Published in: Advances in Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-8858(87)90013-3

zbMATH Keywords

NP complete problemsmolecular biologysubadditive ergodic theorempartition problembiochemistrysubadditive processesannealing algorithmrestriction enzymescircular DNAcircular mapsDNA mappingDNA subsequencedouble digest problemenzyme cutsinexact experimental measurementsmultiple digest problemstochastic relaxation algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Physiological, cellular and medical topics (92Cxx)

Related Items (11)

The restriction mapping problem revisited. ⋮ Mean square rates of convergence in the continuous time simulated annealing algorithm on \({\mathbb{R}}^ d\) ⋮ DNA physical mapping and alternating Eulerian cycles in colored graphs ⋮ Applications of coding theory to the design of somatic cell hybrid panels ⋮ The number of clone orderings ⋮ Multiple solutions of DNA restriction mapping problems ⋮ Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem ⋮ A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM ⋮ Neighborhood Size in the Simulated Annealing Algorithm ⋮ A partial digest approach to restriction site mapping ⋮ Partial digest is hard to solve for erroneous input data

Cites Work

• Unnamed Item
• Optimization by Simulated Annealing
• Interval graphs and maps of DNA
• Subadditive ergodic theory
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Renewal theory for several patterns
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Cooling Schedules for Optimal Annealing
• Equation of State Calculations by Fast Computing Machines
• Computer Solutions of the Traveling Salesman Problem

This page was built for publication: Mapping DNA by stochastic relaxation