Constraint checking for restriction site mapping

Introduces an algorithm for the restriction site mapping problem, based on Pratt's separation theory. The algorithm accepts data from single and double digests of a DNA molecule, in which every fragment is given a range of possible lengths depending on experimental errors. As fragments are being assembled into potential maps of the original molecule, a sound and complete constraint checker is applied which extracts the maximum amount of information from fragment lengths. A fast checking algorithm for two enzymes is presented, and an extension of Floyd's algorithm for the all-pairs shortest paths problem is adopted for multi-enzyme cases. Existing methods for checking fragment lengths are either weaker subset or special cases of the authors' methods.<<ETX>>

[1]  M Krawczak.  Algorithms for the restriction-site mapping of DNA molecules. , 1988, Proceedings of the National Academy of Sciences of the United States of America.

[2]  Donald B. Johnson,et al.  A Note on Dijkstra's Shortest Path Algorithm , 1973, JACM.

[3]  B. Bellon,et al.  Construction of restriction maps , 1988, Comput. Appl. Biosci..

[4]  Robert E. Shostak,et al.  Deciding Linear Inequalities by Computing Loop Residues , 1981, JACM.

[5]  W. R. Pearson.  Automatic construction of restriction site maps , 1982, Nucleic Acids Res..

[6]  F R Blattner,et al.  Least-squares method for restriction mapping. , 1978, Gene.

[7]  Lloyd Allison,et al.  Restriction site mapping for three or more enzymes , 1990, Comput. Appl. Biosci..

[8]  Trevor I. Dix,et al.  Shortest Path and Closure Algorithms for Banded Matrices , 1991, Inf. Process. Lett..

[9]  R. Durand,et al.  An efficient program to construct restriction maps from experimental data with realistic error levels , 1984, Nucleic Acids Res..

[10]  T. Smith,et al.  Mapping the order of DNA restriction fragments. , 1983, Gene.

[11]  C. N. Yee,et al.  Restriction site mapping is in separation theory , 1988, Comput. Appl. Biosci..

[12]  G P Nolan,et al.  Plasmid mapping computer program , 1984, Nucleic Acids Res..

[13]  Pierre Tufféry,et al.  Restriction map construction using a 'complete sentences compatibility' algorithm , 1988, Comput. Appl. Biosci..

[14]  Mark Stefik,et al.  Inferring DNA Structures from Segmentation Data , 1978, Artif. Intell..