Abstract
Motivation: 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. Contact: blazewic@sol.put.poznan.pl * To whom correspondence should be addressed. † Fellowship holder of the Foundation for Polish Sciences.