Restrictionmappinggenerallyrequires the applicationof information from various digestions by restriction enzymesto find solution sets. Weuse boththe predicate calculusandconstraint solvingcapabilities of CLP(R) developan enginefor restriction mapping.Manyof the techniques employedby biologists to manuallyfind solutions are supportedby the engine in a consistent manner. Weprovide generalized pipeline and crossmultiplyoperators for combiningsub-maps.Ourapproach encouragesthe building of mapsiteratively. Weshowhow othertechniquescanbe readilyincorporated.
Trevor I. Dix, Chut N. Yee