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.
This work was supported in part by NSF grants IRI-9625055 and IRI-9632871.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Byon, P. Z. Revesz. DISCO: A Constraint Database System with Sets. Proc. Workshop on Constraint Databases and Applications, Springer-Verlag LNCS 1034, pp. 68–83, September 1995.
T.I. Dix, C.N. Yee. A restriction mapping engine using constraint logic programming, Proceedings of 2nd International Conference on Intelligent Systems for Molecular Biology, AAAI Press, pp. 112–120, 1994.
A. Dovier, G. Rossi. Embedding extensional finite sets in CLP. International Logic Programming Symposium, 1993.
ECLIPSE. Eclipse user manual. Technical report. ECRC, 1994.
C. Gervet. Conjunto: Constraint Logic Programming with Finite Set Domains. Proc. International Logic Programming Symposium, 339–358, 1994.
W. Gillett. DNA Mapping Algorithms: Strategies for Single Restriction Enzyme and Multiple Restriction Enzyme Mapping. Washington Univ. Tech. Report WUCS-92-29.
E. Harley, A. Bonner, N. Goodman. Good maps are straight. Proc. 4th Int. Conf. on Intelligent Systems for Molecular Biology, p. 88–97, June 1996.
J. Jaffar, S. Michaylov, P.J. Stuckey, R.H. Yap. The CLP(R) Language and System. ACM Transactions on Programming Languages and Systems, 14:3, 339–395, 1992.
P. C. Kanellakis, G. M. Kuper, P. Z. Revesz. Constraint Query Languages. Journal of Computer and System Sciences, vol. 51, 26–52, 1995.
R. M. Karp. Mapping the genome: some combinatorial problems arising in molecular biology. Proc. 25th ACM Symp. on Theory of Computing, 278–285, 1993.
E. S. Lander, M. S. Waterman. Genomic mapping by fringerprinting random clones: A mathematical analysis. Genomics, Vol. 2, 231–239, 1988.
B. Legeard, E. Legros. Short overview of the CLPS System. Proc. PLILP, 1991.
M. V. Olson et al. Random-clone strategy for genomic restriction mapping in yeast. Genomics, vol. 83, 7826–7830, 1986.
R. Ramakrishnan, D. Srivastava, S. Sudarshan. CORAL: Control, Relations and Logic. Proc. VLDB, 1992.
P. Z. Revesz. A Closed Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints, Theoretical Computer Science, vol. 116, no. 1, 117–149, 1993.
P. Z. Revesz. Datalog Queries of Set Constraint Databases, Fifth International Conference on Database Theory, Springer-Verlag LNCS 893, pp. 425–438, Prague, Czech Republic, January, 1995.
D. Srivastava, R. Ramakrishnan, P.Z. Revesz. Constraint Objects. Proc. 2nd Workshop on Principles and Practice of Constraint Programming, 274–284, 1994.
S. Tsur and C. Zaniolo. LDL: A Logic-Based Data-Language. Proc. VLDB, pp 33–41, 1986.
S. Tsur, F. Olken, D. Naor. Deductive databases for genome mapping. Technical Report LBL-29577, Lawrence Berkeley Laboratiry, Berkeley, CA 94720.
R.H.C. Yap. A Constraint Logic Programming Framework for Constructing DNA Restriction Maps, Artificial Intelligence in Medicine, Vol. 5, 447–464, 1993
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Revesz, P.Z. (1996). Genomic database applications in DISCO. In: Gaede, V., Brodsky, A., Günther, O., Srivastava, D., Vianu, V., Wallace, M. (eds) Constraint Databases and Applications. CDB 1997. Lecture Notes in Computer Science, vol 1191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62501-1_35
Download citation
DOI: https://doi.org/10.1007/3-540-62501-1_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62501-8
Online ISBN: 978-3-540-68049-9
eBook Packages: Springer Book Archive