Abstract
We consider the (l, d) Planted Motif Search Problem, a problem that arises from the need to find transcription factor-binding sites in genomic information. We propose the algorithms PMSi and PMSP which are based on ideas considered in PMS1 [10]. These algorithms are exact, make use of less space than the known exact algorithms such as PMS and are able to tackle instances with large values of d. In particular algorithm PMSP is able to solve the challenge instance (17, 6), which has not reported solved before in the literature. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Davila, J., Balla, S., & Rajasekaran, S. (2006). Space and time efficient algorithms for planted motif search. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3992 LNCS-II, pp. 822–829). Springer Verlag. https://doi.org/10.1007/11758525_110
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
