Fast and practical algorithms for planted (l, d) motif search.

Jaime Davila1, Sudha Balla, Sanguthevar Rajasekaran

  • 1Department of Computer Science and Engineering, University of Connecticut, Storrs, CT 06269-3155, USA. jdavila@engr.uconn.edu

Summary

We developed new algorithms to find DNA motifs with errors, improving the search for transcription factor-binding sites. Our PMSprune algorithm solves previously unsolvable complex instances, advancing genomic analysis.