subadditive ergodic theorempartition problemmolecular biologybiochemistrysubadditive processesannealing algorithmrestriction enzymescircular DNAcircular mapsDNA mappingDNA subsequencedouble digest problemenzyme cutsinexact experimental measurementsmultiple digest problemNP complete problemsstochastic relaxation algorithm
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
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Computer Solutions of the Traveling Salesman Problem
- Cooling Schedules for Optimal Annealing
- Equation of state calculations by fast computing machines
- Interval graphs and maps of DNA
- Optimization by simulated annealing
- Renewal theory for several patterns
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Subadditive ergodic theory
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
Cited in
(16)- Applications of coding theory to the design of somatic cell hybrid panels
- The enhanced double digest problem for DNA physical mapping
- Neighborhood Size in the Simulated Annealing Algorithm
- The restriction mapping problem revisited.
- On the complexity of DNA physical mapping
- Multiple solutions of DNA restriction mapping problems
- The number of clone orderings
- scientific article; zbMATH DE number 4147905 (Why is no real title available?)
- Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem
- A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM
- Constraint Databases
- A partial digest approach to restriction site mapping
- 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\)
- DNA physical mapping and alternating Eulerian cycles in colored graphs
- scientific article; zbMATH DE number 4087485 (Why is no real title available?)
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)
