title: Construction of DNA restriction maps based on a simplified experiment.
abstract: 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.
authors.affiliation: Institute of Computing Science, Poznań University of Technology, Poland. blazewic@sol.put.poznan.pl
authors.forename: J
authors.initials: J
authors.lastname: Błazewicz
authors.forename: P
authors.initials: P
authors.lastname: Formanowicz
authors.forename: M
authors.initials: M
authors.lastname: Kasprzak
authors.forename: M
authors.initials: M
authors.lastname: Jaroszewski
authors.forename: W T
authors.initials: WT
authors.lastname: Markiewicz
mesh_terms: D000465:Algorithms; D019295:Computational Biology; D004247:DNA / Q000235:genetics*; D003627:Data Interpretation, Statistical; D015183:Restriction Mapping / Q000706:statistics & numerical data*
chemical_list: D004247:DNA