1 Redundancy Elimination in Motif Discovery Algorithms

  • FRINCIS CHIN
  • Published 2006

Abstract

The problem of finding motifs in binding sites is very important to the understanding of gene regulatory networks. However, when predicting a set of motifs, existing algorithms suffer the problem of either predicting many redundant motifs (motifs with similar binding sites) or, at the other extreme, missing the hidden motif. In this paper, we formulate the… (More)

Topics

3 Figures and Tables

Slides referencing similar topics