PMS6: A fast algorithm for motif discovery

2012 IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, ICCABS 2012

Volumn , Issue , 2012, Pages

  Bandyopadhyay, Shibdas ^a   Sahni, Sartaj ^a   Rajasekaran, Sanguthevar ^b  

^a UNIVERSITY OF FLORIDA   (United States)

^b UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

Planted motif search; string algorithms

Indexed keywords

FAST ALGORITHMS; MOTIF DISCOVERY; MOTIF SEARCH; PREPROCESSING TIME; RUNTIMES; STRING ALGORITHMS;

ALGORITHMS;

EID: 84860521791     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCABS.2012.6182627     Document Type: Conference Paper

References (22)

1. Bailey, Timothy, L., Williams, N., Misleh, C. and Wilfred, W. Li, MEME:discovering and analyzing DNA and protein sequence motifs, Nucleic Acids Research,34,369-373, 2006.
2. Buhler, J. and Tompa, M., Finding motifs using random projections, Fifth Annual International Conference on Computational Molecular Biology(RECOMB), 2001.
3. Carvalho, A.M., Freitas, A.T. Oliveira, A.L and Sagot M.F., A highly scalable algorithm for the extraction of cis-regulatory regions,Third Asia Pacic Bioinformatics Conference (APBC), 2005.
4. Chin, F Y.L. and Leung H C.M., Voting Algorithms for Discovering Long Motifs, Proceedings of the Third Asia-Pacic Bioinformatics Conference (APBC), 261-271,2005.
5. Davila, J., Balla, S. and Rajasekaran. S., Fast and practical algorithms for planted (l, d) motif search, IEEE/ACM Transactions on Computational Biology and Bioinformatics, 2007.
6. Davila, J., Balla, S and Rajasekaran, S., Pampa: An Improved Branch and Bound Algorithm for Planted (l, d) Motif Search, Tech Report, University of Connecticut, 2007.
7. Dinh, H., Rajasekaran, S. and Kundeti, V., PMS5: an efficient exact algorithm for the (l,d) motif finding problem, BMC Bioinformatics, 12:410, 2011.
8. Eskin, E. and Pevzner, P.,Finding composite regulatory patterns in DNA sequences, Bioinformatics, 2002, 354-363.
9. Evans, P.A., Smith, A., and Todd Warenham, H., On the complexity of finding common approximate substrings,Theoretical Computer Science, 306, 407-430, 2003.
10. Evans, P.A and Smith, A., Toward Optimal Motif Enumeration, Proceedings of Algorithms and Data Structures, 8th International Workshop (WADS), 47-58, 2003.
11. Hertz, G. and Stormo, G., Identifying DNA and protein patterns with statistically significant alignments of multiple sequences, Bioinformatics,15, 563-577, 1999. (Pubitemid 29462105)
12. Horowitz, E., Sahni, S., and Mehta, D., Fundamentals of Data Structures in C++, 2ed, Silicon Press, 2006.
13. Keich, U. and Pevzner, P., Finding motifs in the twilight zone, Bioinformatics, 18,13741381,2002.
14. Kuksa, P.P. and Pavlovic, V., Efficient motif finding algorithms for large-alphabet inputs, BMC Bioinformatics, 11(Suppl 8):S1, 2010.
15. Lawrence, C.E., Altschul, S.F., Boguski, M.S., Liu, J.S., Neuwald, A.F. and Wootton, J.C., Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment, Science, 262,208-214,2003.
16. Marsan, L. and Sagot M.F., Extracting structured motifs using a suffix tree. - Algorithms and application to promoter consensus identification. Fourth Annual International Conference on Computational Molecular Biology(RECOMB), 2000.
17. Pevzner, P. and Sze, S.-H., Combinatorial approaches to finding subtle signals in DNA sequences, Proc. English International Conference on Intelligent Systems for Molecular Biology, 8, 269-278, 2000.
18. Price, A., Ramabhadran, S. and Pevzner, P., Finding subtle motifs by branching from the sample strings. Bioinformatics supplementary edition. Proceedings of the Second European Conference on Computational Biology (ECCB), 2003.
19. Pisanti, N., Carvalho, A.M., Marsan, L and Sagot, M.F., RISOTTO: Fast extraction of motifs with mismatches, Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN), 3887, 757-768, 2006.
20. Rajasekaran, S., Balla, S. and Huang, C.H., Exact algorithms for planted motif challenge problems, Journal of Computational Biology, 12(8),1117-1128, 2005. (Pubitemid 41580026)
21. Rajasekaran S., Dinh, H., A speedup technique for (l, d) motif nding algorithms, BMC Research Notes, 4:54,1-7, 2011.
22. Sagot, M.F. Spelling approximate repeated or common motifs using a suffix tree. Proceedings of the Third Latin American Theoretical Informatics Symposium (LATIN), 111-127, 1998.