J. Bioinformatics (was CABIOS), 6(3), pp.195-204, 1990
Shirley T. S. Ho , Lloyd Allison and Chut N. Yee
Restriction site mapping requires a generator to put forward possible maps and
a constraint checker to reject false maps. Ideally these combine to give
an algorithm which calculates a sound and complete solution set.
Three algorithms for generation are presented and compared.
Two decompose a multi-enzyme problem (≥3) into subproblems.
The constraint checker is based on separation theory. Some insights into
the extent of constraint checking involved in and the feasibility of
more checking for three or more enzymes are discussed.
The trade-off between computation time and the soundness of the
solution set is examined.