Pages that link to "Item:Q1099802"

The following pages link to Mapping DNA by stochastic relaxation (Q1099802):

Displaying 11 items.

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