Abstract
A genome map is an ordering of a set of clones according to their believed position on a DNA string. Simple heuristics for genome map assembly based on single restriction enzyme with complete digestion data can lead to inaccuracies and ambiguities. This paper presents a method that adds additional constraint checking to the assembly process. An automaton is presented that for any genome map produces a refined genome map where both the clones and the restriction fragments in each clone are ordered satisfying natural constraints called step constraints. Any genome map that cannot be refined is highly likely to be inaccurate and can be eliminated as a possibility.
Similar content being viewed by others
References
J. Byon & P.Z. Revesz. (1995). DISCO: A constraint database system with sets. In Proc. Workshop on Constraint Databases and Applications, pages 68–83, Springer-Verlag, Berlin/Heidelberg/New York.
T.I. Dix & C.N. Yee. (1994). A restriction mapping engine using constraint logic programming, In Proceedings of 2nd International Conference on Intelligent Systems for Molecular Biology, pages 112-120, AAAI Press.
A. Dovier & G. Rossi. (1993). Embedding extensional finite sets in CLP. In International Logic Programming Symposium, MIT Press, Cambridge, MA.
C. Gervet. (1994). Conjunto: Constraint logic programming with finite set domains. In Proc. International Logic Programming Symposium, pages 339–358, MIT Press, Cambridge, MA.
W. Gillett. (1992). DNAmapping algorithms: Strategies for single restriction enzyme and multiple restriction enzyme mapping. Washington Univ. Tech. Report WUCS-92-29.
E. Harley, A. Bonner & N. Goodman. (1996). Good maps are straight. Proc. 4th Int. Conf. on Intelligent Systems for Molecular Biology, p. 88-97.
J. Jaffar, S. Michaylov, P. J. Stuckey & R.H.C. Yap. (1992). The CLP(R) language and system. In ACM Transactions on Programming Languages and Systems, Vol. 14, pages 339-395, ACM Press, New York.
P.C. Kanellakis, G.M. Kuper & P.Z. Revesz. (1995). Constraint query languages. Journal of Computer and System Sciences 51:26–52.
R.M. Karp. (1993). Mapping the genome: some combinatorial problems arising in molecular biology. In Proc. 25th ACM Symp. on Theory of Computing, pages 278-285, ACM Press, New York.
E.S. Lander & M.S. Waterman. (1988). Genomic mapping by fringerprinting random clones: Amathematical analysis. Genomics 2:231-239.
B. Legeard & E. Legros. (1991). Short overview of the CLPS System. In Proc. PLILP.
M.V. Olson et al. (1986). Random-clone strategy for genomic restriction mapping in yeast. Genomics 83:7826–7830.
R. Ramakrishnan, D. Srivastava & S. Sudarshan. (1992). CORAL: Control, relations and logic. In Proc. VLDB.
P.Z. Revesz. (1993). A closed-form evaluation for datalog queries with integer (gap)-order constraints. Theoretical Computer Science 116:117-149.
P.Z. Revesz. (1995). Datalog queries of set constraint databases, In Fifth International Conference on Database Theory, pages 425–438, Springer-Verlag, Berlin/Heidelberg/New York.
P.Z. Revesz. (1996). Genomic database applications in DISCO, In Proc. CP'96 Workshop on Constraints and Databases, pages 234–245, Springer-Verlag, Berlin/Heidelberg/New York.
D. Srivastava, R. Ramakrishnan & P.Z. Revesz. (1994). Constraint objects. In Proc. 2nd Workshop on Principles and Practice of Constraint Programming, pages 274–284, Springer-Verlag, Berlin/Heidelberg/New York.
S. Tsur & C. Zaniolo, (1986). LDL: A logic-based data-language. In Proc. VLDB, pages 33-41.
S. Tsur, F. Olken & D. Naor. (1994). Deductive databases for genome mapping. Technical Report LBL-29577, Lawrence Berkeley Laboratiry, Berkeley, CA.
R.H.C. Yap. (1993). A constraint logic programming framework for constructing DNA restriction maps, Artificial Intelligence in Medicine 5:447–464.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Revesz, P.Z. Refining Restriction Enzyme Genome Maps. Constraints 2, 361–375 (1997). https://doi.org/10.1023/A:1009751730500
Issue Date:
DOI: https://doi.org/10.1023/A:1009751730500