The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
A closed-form evaluation for Datalog queries with integer (gap)-order constraints
ICDT Selected papers of the 4th international conference on Database theory
Mapping the genome: some combinatorial problems arising in molecular biology
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Embedding extensional finite sets in CLP
ILPS '93 Proceedings of the 1993 international symposium on Logic programming
Conjunto: constraint logic programming with finite set domains
ILPS '94 Proceedings of the 1994 International Symposium on Logic programming
Selected papers of the 9th annual ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Datalog Queries of Set Constraint Databases
ICDT '95 Proceedings of the 5th International Conference on Database Theory
Proceedings of the Fourth International Conference on Intelligent Systems for Molecular Biology
PPCP '94 Proceedings of the Second International Workshop on Principles and Practice of Constraint Programming
LDL: A Logic-Based Data Language
VLDB '86 Proceedings of the 12th International Conference on Very Large Data Bases
CORAL - Control, Relations and Logic
VLDB '92 Proceedings of the 18th International Conference on Very Large Data Bases
DISCO: A Constraint Database System with Sets
Proceedings of the ESPRIT WG CONTESSA Workshop on Constraint Databases and Applications
Genomic Database Applications in DISCO
CDB '97 Second International Workshop on Constraint Database Systems, Constraint Databases and Their Applications
A retrospective on constraint databases
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
| Hi-index | 0.00 |
A genome map is an ordering of a set of clones accordingto their believed position on a DNA string. Simple heuristicsfor genome map assembly based on single restriction enzyme withcomplete digestion data can lead to inaccuracies and ambiguities.This paper presents a method that adds additional constraintchecking to the assembly process. An automaton is presented thatfor any genome map produces a refined genome map where both theclones and the restriction fragments in each clone are orderedsatisfying natural constraints called step constraints. Any genomemap that cannot be refined is highly likely to be inaccurateand can be eliminated as a possibility.