Mapping DNA by stochastic relaxation

DOI10.1016/0196-8858(87)90013-3zbMATH Open0638.92005OpenAlexW2059127308MaRDI QIDQ1099802FDOQ1099802

Authors: Larry Goldstein, Michael S. Waterman 

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

Recommendations

• On the complexity of DNA physical mapping
• Stochastic models for heterogeneous DNA sequences
• scientific article; zbMATH DE number 4087485
• Genome mapping by random anchoring: A discrete theoretical analysis
• DNA rearrangements through spatial graphs
• scientific article; zbMATH DE number 1959501
• Genome mapping by nonrandom anchoring: a discrete theoretical analysis.
• scientific article; zbMATH DE number 1617274
• The enhanced double digest problem for DNA physical mapping
• A representation of DNA primary sequences by random walk

zbMATH Keywords

subadditive ergodic theorempartition problemmolecular biologybiochemistrysubadditive processesannealing algorithmrestriction enzymescircular DNAcircular mapsDNA mappingDNA subsequencedouble digest problemenzyme cutsinexact experimental measurementsmultiple digest problemNP complete problemsstochastic relaxation algorithm

Mathematics Subject Classification ID

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

Cites Work

• Optimization by simulated annealing
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Equation of state calculations by fast computing machines
• Title not available (Why is that?)
• Cooling Schedules for Optimal Annealing
• Subadditive ergodic theory
• Computer Solutions of the Traveling Salesman Problem
• Interval graphs and maps of DNA
• The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
• Renewal theory for several patterns

Cited In (16)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1099802)