Abstract
We present a new, practical algorithm to resolve the experimental data in restriction site analysis, which is a common technique for mapping DNA. Specifically, we assert that multiple digestions with a single restriction enzyme can provide sufficient information to identify the positions of the restriction sites with high probability. The motivation for the new approach comes from combinatorial results on the number of mutually homeometric sets in one dimension, where two sets ofn points are homeometric if the multiset ofn(n−1)/2 distances they determine are the same.
Since experimental data contain errors, we propose algorithms for reconstructing sets from noisy interpoint distances, including the possibility of missing fragments. We analyse the performance of these algorithms under a reasonable probability distribution, establishing a relative error limit ofr=Θ(1/n 2) beyond which our technique becomes infeasible. Through simulations, we establish that our technique is robust enough to reconstruct data with relative errors of up to 7.0% in the measured fragment lengths for typical problems, which appears sufficient for certain biological applications.
Similar content being viewed by others
References
Allison, L., S. Ho and C. N. Yee. 1990. Restriction site mapping for three or more enzymes.Comput. Appl. Biol. Sci. 6, 195–204.
Allison, L. and C. N. Yee. 1988. Retriction site mapping is in separation theory.Comput. Appl. Biol. Sci. 4, 97–101.
Bellon, B. 1988. Construction of restriction maps.Comput. Appl. Biol. Sci. 4, 111–115.
Boppana, R. and J. Spencer. 1989. A useful elementary correlation inequality.J. Combinatorial Theory, Series A 50, 305–307.
Chang, W. I. 1991. Personal communication.
Chang, W. I. and T. Marr. 1992. Personal communication.
Dix, T. I. and D. H. Kieronska. 1988. Errors between sites in restriction site mapping.Comput. appl. biol. Sci.,4, 117–123, 1988.
Goldstein, L. and M. S. Waterman. 1987. Mapping DNA by stochastic relaxation.Adv. appl. Math. 8, 194–207.
Grigorjev, A. V. and A. A. Mironov. 1990. Mapping DNA by stochastic relaxation: a new approach to fragment sizes.Comput. appl. biol. Sci. 6, 107–111.
Lemke, P. and M. Werman. 1988. On the complexity of inverting the autocorrelation function of a finite integer sequence, and the problem of locatingn points on a line, given the unlabeled distances between them.
Lenstra, A. K., H. W. Lenstra Jr and L. Lovasz. 1982. Factoring polynomials with rational coefficients.Math. Ann. 261, 515–534.
Maniatis, T., E. F. Fritsch and J. Sambrook.Molecular Cloning, a Laboratory Manual. Cold Spring Harbor, NY: Cold Spring Harbor Laboratory.
Newberg, L. and D. Naor, 1993. A lower bound on the number of solutions to the probed partial digest problem.Adv. appl. Math. 14 (2).
Patterson, A. L. 1935. A direct method for the determination of the components of interatomic distances in crystals.Zeitschr. Krist. 90, 517–542.
Patterson, A. L. 1944. Ambiguities in the x-ray analysis of crystal structures.Phys. Rev. 65, 195–201.
Rhee, G. 1988. DNA restriction mapping from random-clone data. Technical Report WUCS-88-18, Department of Computer Science, Washington University, St Louis MO.
Rosenblatt, J. and P. Seymour. The structure of homometric sets.SIAM J. Alg. Disc. Meth. 3, 343–350.
Skiena, S. S., W. D. Smith and P. Lemke. 1990. Reconstructing sets from interpoint distances. InProc. Sixth ACM Symp. Computational Geometry, pp. 332–339.
Spencer, J. and J. Pach. 1992. Bounds on no bonds and distance gaps in the plane.
Stefik, M. Inferring DNA structures from segmentation data.Artificial Intelligence,11, 85–114.
Sutherland, R. A. and M. D. Partis. 1992. Using fragment lengths from incomplete digestion by multiply cleaving enzymes to map antibody binding sites on a protein.Comput. appl. biol. Sci. 8, 1–4.
Tuffery, P., P. Dessen, C. Mugnier and S. Hazout. 1988. Restriction map construction using a ‘complete sentences compatibility’ algorithm.Comput. appl. biol. Sci. 4, 103–110.
Weiss, M. A. 1992.Data Structures and Algorithm Analysis. Redwood City, CA: Benjamin Cummings.
Zhang, Z. 1993. An exponential example for partial digest mapping algorithm. Tech Report, Computer Science Dept., Penn. State University.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Skiena, S.S., Sundaram, G. A partial digest approach to restriction site mapping. Bltn Mathcal Biology 56, 275–294 (1994). https://doi.org/10.1007/BF02460643
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02460643