Testing Whether a Set of Code Words Satisfies a Given Set of Constraints

Abstract

This paper investigates the problem of testing whether a set of code words satisfies certain biologically motivated Hamming distance constraints. The paper provides three general techniques to speed up the testing of the constraints, namely, the Enumeration, Table Lookup, and Encoding methods, with applications to the design of DNA words.