Constraint checking for circular restriction site mapping [DNA]

Computationally, constraint checking for circular restriction site maps is considerably more difficult than for linear maps. The authors consider complete single and double digestions of plasmids, circular DNA molecules. To allow for experimental error in fragment measurements, a range is specified for each fragment length. The authors find exactly those solutions that satisfy the discrete constraints of the date. For sites s_i and s_j they consider linear inequalities in either of the forms L_ij⩽s_j-s_i⩽H_ij or L _ij⩽c-(s_j-s_i)⩽H_ij where s_i<s_j, the measured fragment is in the range [L_ij,H_ij] and c is the length of the map. For consistent inequalities, minimum ranges for fragments are found. Otherwise inconsistent inequalities are detected