A combinatorial optimization approach for diverse motif finding applications.

ABSTRACT:

Background

Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most frequently, motif finding applications arise when identifying shared regulatory signals within DNA sequences or shared functional and structural elements within protein sequences. Due to the diversity of contexts in which motif finding is applied, several variations of the problem are commonly studied.

Results

We introduce a versatile combinatorial optimization framework for motif finding that couples graph pruning techniques with a novel integer linear programming formulation. Our approach is flexible and robust enough to model several variants of the motif finding problem, including those incorporatin

SUBMITTER: Zaslavsky E 

PROVIDER: S-EPMC1570465 | biostudies-literature | 2006 Aug

REPOSITORIES: biostudies-literature