Errors between sites in restriction site mapping

Restriction site mapping programs construct maps by generatingpermutations of fragments and checking for consistency. Unfortunatelymany consistent maps often are obtained within the experimentalerror bounds, even though there is only one actual map. A particularlyefficient algorithm is presented that aims to minimize errorbounds between restriction sites. The method is generalizedfor linear and circular maps. The time complexity is derivedand execution times are given for multiple enzymes and a rangeof error bounds. Received on July 17, 1987; accepted on November 3, 1987