Exact algorithms for planted motif challenge problems

Series on Advances in Bioinformatics and Computational Biology

Volumn 1, Issue , 2005, Pages 249-259

  Rajasekaran, Sanguthevar ^a   Balla, Sudha ^a   Huang, Chun Hsi ^a  

^a University of Connecticut   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BIOINFORMATICS;

BIOLOGICAL DATA; CHALLENGE PROBLEMS; EXACT ALGORITHMS;

APPROXIMATION ALGORITHMS;

EID: 84863048117     PISSN: 17516404     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1142/9781860947322_0025     Document Type: Conference Paper

References (18)

1. T. L. Bailey and C. Elkan. Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning 21(1-2), 1995, pp. 51-80.
2. M. Blanchette. Algorithms for phylogenetic footprinting. Proc. Fifth Annual International Conference on Computational Molecular Biology, 2001.
3. M. Blanchette, B. Schwikowski, and M. Tompa. An exact algorithm to identify motifs in orthologous sequences from multiple species. Proc. Eighth International Conference on Intelligent Systems for Molecular Biology, 2000, pp. 37-45.
4. A. Brazma, I. Jonassen, J. Vilo, and E. Ukkonen. Predicting gene regulatory elements in silico on a genomic scale. Genome Research 15, 1998, pp. 1202-1215. (Pubitemid 29027223)
5. J. Buhler and M. Tompa. Finding motifs using random projections. Proc. 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. G. Hertz and G. Stormo. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 15, 1999, pp. 563-577. (Pubitemid 29462105)
8. E. Horowitz, S. Sahni, and S. Rajasekaran. Computer Algorithms, W. H. Freeman Press, 1998.
9. U. Keich and P. Pevzner. Finding motifs in the twilight zone. Bioinformatics 18, 2002, pp. 1374-1381. (Pubitemid 35244195)
10. C. E. Lawrence, S. F. Altschul, M. S. Boguski, J. S. Liu, A. F. Neuwald, and J. C. Wootton. Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science 262, 1993, pp. 208-214.
11. 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.
12. A. Price, S. Ramabhadran and P. A. Pevzner. Finding subtle motifs by branching from sample strings. Bioinformatics 1(1), 2003, pp. 1-7.
13. S. Rajasekaran, S. Balla, C.-H. Huang, V. Thapar, M. Gryk, M. Maciejewski, and M. Schiller. Exact algorithms for motif search. Proc. Asia-Pacific Bioinformatics Conference, 2005.
14. E. Rocke andM. Tompa. An algorithm for finding novel gapped motifs in DNA sequences. Proc. Second International Conference on Computational Molecular Biology (RECOMB), 1998, pp. 228-233.
15. S. Sinha and M. Tompa. A statistical method for finding transcription factor binding sites. Proc. Eighth International Conference on Intelligent Systems for Molecular Biology, 2000, pp. 344-354.
16. R. Staden. Methods for discovering novel motifs in nucleic acid sequences. Computer Applications in the Biosciences 5(4), 1989, pp. 293-298. (Pubitemid 19274602)
17. M. Tompa. An exact method for finding short motifs in sequences, with application to the ribo some binding site problem. Proc. Seventh International Conference on Intelligent Systems fo Molecular Biology, 1999, pp. 262-271.
18. J. van Helden, B. Andre, and J. Collado-Vides. Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. Journal of Molecular Biology 281(5), 1998, pp. 827-842. (Pubitemid 28408432)