Exact algorithms for planted motif challenge problems

  title={Exact algorithms for planted motif challenge problems},
  author={Sanguthevar Rajasekaran and Sudha Balla and Chun-Hsi Huang},
The problem of identifying meaningful patterns (i.e., motifs) from biological data has been studied extensively due to its paramount importance. Three versions of this problem have been identified in the literature. One of these three problems is the planted (l, d)-motif problem. Several instances of this problem have been posed as a challenge. Numerous algorithms have been proposed in the literature that address this challenge. Many of these algorithms fall under the category of approximation… CONTINUE READING

Topics from this paper.


Publications referenced by this paper.


  • S. Rajasekaran, S. Balla, C.-H. Huang, V. Thapar, M. Gryk
  • Maciejewski, and M. Schiller. Exact algorithms…
  • 2005

Pevzner . Finding subtle motifs by branching from sample strings

  • C.-H. Huang, M. Gryk, M. Maciejewski
  • Bioinformatics
  • 2003

and P

  • A. Price, S. Ramabhadra
  • A. Pevzner. Finding subtl e motifs by branching…
  • 2003

Pevzner . Finding composite regulatory patterns in DNA sequences

  • G. Stormo
  • 2002

Pevzner . Finding motifs in the twilight zone

  • S. F. Altschul, M. S. Boguski, J. S. Liu, A. F. Neuwald, J. C. Wootton
  • Bioinformatics
  • 2002

and P

  • U. Keic
  • Pevzner. Finding motifs in the twilight zon e…
  • 2002

Finding motifs using random projections

  • P.
  • Proc . Fifth Annual International Conference on…
  • 2001

and M

  • J. Buhle
  • Tompa. Finding motifs using random projec tions…
  • 2001

Similar Papers

Loading similar papers…