A simple algorithm for (l, d) motif search

Authors:
Dolly Sharma;Sanguthevar Rajasekaran
Affiliations:
Computer Science & Engineering, University of Connecticut, Storrs, CT;Computer Science & Engineering, University of Connecticut, Storrs, CT
Venue:
CIBCB'09 Proceedings of the 6th Annual IEEE conference on Computational Intelligence in Bioinformatics and Computational Biology
Year:
2009

Citing 6
Cited 0

Finding motifs using random projections

RECOMB '01 Proceedings of the fifth annual international conference on Computational biology
On the closest string and substring problems

Journal of the ACM (JACM)
Combinatorial Approaches to Finding Subtle Signals in DNA Sequences

Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology
Fast and Practical Algorithms for Planted (l, d) Motif Search

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Space and time efficient algorithms for planted motif search

ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part II
A graph clustering approach to weak motif recognition

WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Extracting meaningful patterns from voluminous amount of biological data is a very big challenge. Motifs are biological patterns of great interest to biologists. There are different versions of the Motif Finding Problem. In this paper we concentrate on the Planted (l, d) Motif Search Problem. There have been numerous algorithms designed to solve this problem. Many instances of the Planted (l, d) Motif Problem have been identified as challenging instances. The algorithm proposed here is an extension of PMS3 [1]. It uses a very simple approach and solves challenging instances ((21, 8), for example) that have not been reported solved before in the literature. We also propose a new algorithm PMS3p. We expect PMS3p to be significantly faster than PMS3.