Pampa : An Improved Branch and Bound Algorithm for Planted ( l , d ) Motif Search

@inproceedings{DavilaPampaA,
  title={Pampa : An Improved Branch and Bound Algorithm for Planted ( l , d ) Motif Search},
  author={Jaime Davila and Sudha Balla and Sanguthevar Rajasekaran}
}
We consider the planted (l, d) motif search problem as defined in [1] and [12], a problem that arises from the need to find transcription factor-binding sites in genomic information. We build an exact branch and bound algorithm, which has small space requirements. An implementation of this algorithm is able to tackle challenging instances as big as (19, 7), cutting by half the time required by the best existing algorithm. 
Highly Cited
This paper has 28 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-8 of 8 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 19 references

Finding Motifs Using Random Projections

Journal of Computational Biology • 2002
View 10 Excerpts
Highly Influenced

Toward Optimal Motif Enumeration

View 5 Excerpts
Highly Influenced

A Practical Branch and Bound Algorithm for Planted (l, d) Motif Search

J. Davila, S. Rajasekaran
UConn BECAT/CSE Technical Report, • 2006
View 2 Excerpts

Algorithms for Motif Search, in Handbook of Computational Molecular Biology, edited by S

S. Rajasekaran
2006
View 1 Excerpt

Pevzner , Finding composite regulatory patterns in DNA sequences

S. Rajasekaran, P.
Bioinformatics S • 2006

Similar Papers

Loading similar papers…