Boolean programming formulation of some pattern-matching problems in molecular biology

Abstract

The mathematical structure of several matching calculations of importance in molecular biology are examined. Several of these can be cast into a common form, a linear Boolean programming problem, for which algorithms and software exist. Our particular interest is in the problem of defining protein folding patterns and developing algorithms for finding matching substructures. The relationship of the approach presented here to others is examined.