Constraint satisfaction in logic programming
Constraint satisfaction in logic programming
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Sicstus prolog-the first 25 years
Theory and Practice of Logic Programming - Prolog Systems
| Hi-index | 0.00 |
This article describes a dispensation order generation algorithm for genotyping using the Pyrosequencing method. The input template of the algorithm is a slightly restricted regular expression over the DNA strings that can be expected in a given sample. The algorithm computes a dispensation order that allows for determining, for each polymorphism in the input template, the genotype of any sample.The algorithm has the structure of a non-deterministic rewrite system, which gives rise to a search tree. We show that within any branch of the search tree, the rewrite system is confluent and terminating. We use nogood generation and limited discrepancy search to prune the search tree and to focus the search for shorter dispensation orders before looking for longer ones.The algorithm as described herein assumes samples from a diploid genome, but can readily be generalized to general k-ploid genomes.