Constraint checking for circular restriction site mapping (DNA)

Abstract

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/sub i/ and s/sub j/ they consider linear inequalities in either of the forms L/sub ij/>