The restriction mapping problem revisited.

DOI10.1016/S0022-0000(02)00008-9zbMath1059.68159MaRDI QIDQ1872722

H. Ramesh, Gopal Pandurangan

Publication date: 14 May 2003

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

zbMATH Keywords

labeled partial digest

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Protein sequences, DNA sequences (92D20)

Related Items (3)

Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem ⋮ A SCALABLE PARALLEL ALGORITHM FOR TURNPIKE PROBLEM ⋮ Partial digest is hard to solve for erroneous input data

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mapping DNA by stochastic relaxation
• A lower bound on the number of solutions to the probed partial digest problem
• A partial digest approach to restriction site mapping
• The Structure of Homometric Sets

This page was built for publication: The restriction mapping problem revisited.