Construction of DNA restriction maps based on a simplified experiment.
BACKGROUND
A formulation of a new problem of the restriction map construction based on a simplified digestion experiment and a development of an algorithm for solving both ideal and noisy data cases of the introduced problem.


RESULTS
A simplified partial digest problem and a branch and cut algorithm for finding the solution of the problem.
Błazewicz
J
J
Institute of Computing Science, Poznań University of Technology, Poland. blazewic@sol.put.poznan.pl
Formanowicz
P
P
Kasprzak
M
M
Jaroszewski
M
M
Markiewicz
W T
WT
D000465:Algorithms; D019295:Computational Biology; D004247:DNA / Q000235:genetics*; D003627:Data Interpretation, Statistical; D015183:Restriction Mapping / Q000706:statistics & numerical data*
D004247:DNA