Constraint Programming; Bioinformatics; NP-completeness

This paper investigates alternative global constraints that can be introduced in a constraint solver over discrete crystal lattices. The objective is to enhance the efficiency of lattice solvers in dealing with the construction of approximate …

The paper expands on the growing body of literature which makes use of constraint programming techniques to solve bioinformatics problems, es- pecially in the context of discrete models. The focus is on the use of constraint programming methodologies …