A simple algorithm for (l, d) motif search

2009 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology, CIBCB 2009 - Proceedings

Volumn , Issue , 2009, Pages 148-154

  Sharma, Dolly ^a   Rajasekaran, Sanguthevar ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL DATA; MOTIF FINDING; MOTIF SEARCH; SIMPLE ALGORITHM; SIMPLE APPROACH;

AGRICULTURE; ALGORITHMS; BIOINFORMATICS; BIOLOGY;

PROBLEM SOLVING;

EID: 67650351107     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CIBCB.2009.4925721     Document Type: Conference Paper

References (11)

1. S. Rajasekaran, S. Balla, and C.-H. Huang, "Exact Algorithms for Planted Motif Problems", Journal of Computational Biology, Oct 2005, Vol. 12, No. 8: 1117-1128. (Pubitemid 41580026)
2. S. Rajasekaran, "Motif search algorithms", in Handbook of Computational Molecular Biology, CRC Press, 2005.
3. Jaime Davila, Sudha Balla, Sanguthevar Rajasekaran, "Fast and Practical Algorithms For Planted (l, d) Motif Search", IEEE/ACM Transactions TCBB, 2007. (Pubitemid 350125878)
4. Christina Boucher, Daniel G. Brown, Paul Church, "A Graph Clustering Approach to weak Motif Recognition", WABI 2007, LNBI 4645.
5. J. Buhler and M. Tompa, "Finding motifs using random projections", Proceedings Fifth Annual International Conference on Computational Molecular Biology (RECOMB), April 2001.
6. E. Eskin and P. Pevzner, "Finding composite regulatory patterns in DNA sequences", Bioinformatics S1, 2002, pp. 354-363.
7. P. Pevzner and S.-H. Sze, "Combinatorial approaches to finding subtle signals in DNA sequences", Proc. Eighth International Conference on Intelligent Systems for Molecular Biology, 2000, pp. 269-278.
8. A. Price, S. Ramabhadran, P. Pevzner, "Finding subtle motifs by branching from sample strings", Bioinformatics supplementary edition, Proceedings of the Second European Conference on Computational Biology (ECCB-2003).
9. J. Davila, S. Balla and S. Rajasekaran, "Space And Time Efficient Algorithms for Planted Motif Search", Second International Workshop on Bioinformatics Research and Applications (IWBRA 2006), May 2006.
10. M. Li, B. Ma and L. Wang, "On the Closest String and Substring Problems", Journal of the ACM, Vol. 49, No. 2, March 2002. (Pubitemid 44159318)
11. F Y.L. Chin and H C.M. Leung, "Voting Algorithms for Discovering Long Motifs", Proceedings of the Third Asia-Pacific Bioinformatics Conference (APBC2005), Singapore, 261-271, January 2005.