A speedup technique for (l, d)-motif finding algorithms

BMC Research Notes

Volumn 4, Issue , 2011, Pages

  Rajasekaran, Sanguthevar ^a   Dinh, Hieu ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 79952351466     PISSN: None     EISSN: 17560500     Source Type: Journal    
DOI: 10.1186/1756-0500-4-54     Document Type: Article

References (24)

1. Computational techniques for motif search. S Rajasekaran, Frontiers in Bioscience 2009 14 5052 5065 10.2741/3586 19482604
2. Fitting a mixture model by expectation maximization to discover motifs in biopolymers. T Bailey C Elkan, Proc. Second International Conference on Intelligent Systems for Molecular Biology 1994 28 36
3. Finding motifs using random projections. J Buhler M Tompa, Proc. Fifth Annual International Conference on Computational Molecular Biology (RECOMB) 2001
4. Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. CE Lawrence MS B JS L AF N SF Altschul JC Wootton, Science 1993 262 208 214 10.1126/science.8211139 8211139
5. Combinatorial approaches to finding subtle signals in DNA sequences. P Pevzner SH Sze, Proc. Eighth International Conference on Intelligent Systems for Molecular Biology 2000 269 278
6. An algorithm for finding novel gapped motifs in DNA sequences. E Rocke M Tompa, Proc. Second International Conference on Computational Molecular Biology (RECOMB) 1998 228 233
7. Finding motifs in the twilight zone. U Keich P Pevzner, Bioinformatics 2002 18 1374 1381 10.1093/bioinformatics/18.10.1374 12376382 (Pubitemid 35244195)
8. Finding subtle motifs by branching from sample strings. A Price S R PA Pevzner, Bioinformatics 2003 1 1 7
9. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. G Hertz G Stormo, Bioinformatics 1999 15 563 577 10.1093/bioinformatics/15.7.563 10487864 (Pubitemid 29462105)
10. An exact algorithm to identify motifs in orthologous sequences from multiple species. M Blanchette B S M Tompa, Proc. Eighth International Conference on Intelligent Systems for Molecular Biology 2000 37 45
11. Finding composite regulatory patterns in DNA sequences. E Eskin P Pevzner, Bioinformatics 2002 S1 354 363
12. Predicting gene regulatory elements in silico on a genomic scale. A Brazma J V I Jonassen E Ukkonen, Genome Research 1998 15 1202 1215 (Pubitemid 29027223)
13. Rigorous pattern-recognition methods for DNA sequences: Analysis of promoter sequences from Escherichia coli. DJ Galas M E MS Waterman, Journal of Molecular Biology 1985 186 117 128 10.1016/0022-2836(85)90262-1 3908689 (Pubitemid 16226569)
14. A statistical method for finding transcription factor binding sites. S Sinha M Tompa, Proc. Eighth International Conference on Intelligent Systems for Molecular Biology 2000 344 354
15. Methods for discovering novel motifs in nucleic acid sequences. R Staden, Computer Applications in the Biosciences 1989 5 4 293 298 2684350 (Pubitemid 19274602)
16. An exact method for finding short motifs in sequences, with application to the ribosome binding site problem. M Tompa, Proc. Seventh International Conference on Intelligent Systems for Molecular Biology 1999 262 271
17. Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J van Helden B A J Collado-Vides, Journal of Molecular Biology 1998 281 5 827 842 10.1006/jmbi.1998.1947 9719638 (Pubitemid 28408432)
18. Exact algorithms for planted motif challenge problems. SB S Rajasekaran CH Huang, Journal of Computational Biology 2005 12 8 1117 1128 10.1089/cmb.2005.12.1117 16241901
19. Algorithms for Discovering Long Motifs. F Chin H Leung, Proceedings of the Third Asia-Pacific Bioinformatics Conference (APBC2005), Singapore 2005 261 271
20. RISOTTO: Fast extraction of motifs with mismatches. N Pisanti L M AM Carvalho MF Sagot, Proceedings of the 7th Latin American Theoretical Informatics Symposium 2006 757 768 (Pubitemid 43986654)
21. Fast and practical algorithms for planted (l, d) motif search. J Davila S B S Rajasekaran, IEEE/ACM Transactions on Computational Biology and Bioinformatics 2007 544 552 10.1109/TCBB.2007.70241 (Pubitemid 350125878)
22. E Horowitz S S S Rajasekaran, Computer Algorithms W. H. Freeman Press 1998
23. Spelling approximate repeated or common motifs using a suffix tree. M Sagot, Springer-Verlag LNCS 1380 1998 111 127
24. S Rajasekaran, Motif Search Algorithms in Handbook of Computational Molecular Biology CRC Press 2006