Exact algorithms for planted motif problems

Journal of Computational Biology

Volumn 12, Issue 8, 2005, Pages 1117-1128

  Rajasekaran, Sanguthevar ^a   Balla, S ^a   Huang, C H ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

Exact algorithms; Heuristic algorithms; Motif search; Planted motif problems

Indexed keywords

DIHYDROFOLATE REDUCTASE; DNA; METALLOTHIONEIN; PREPROINSULIN;

ALGORITHM; ARTICLE; DNA SEQUENCE; MATHEMATICAL ANALYSIS; NONHUMAN; ONCOGENE C FOS; PRIORITY JOURNAL; PROBABILITY; PROTEIN MOTIF; YEAST;

ALGORITHMS; BASE SEQUENCE; COMPUTATIONAL BIOLOGY; SEQUENCE ANALYSIS, DNA;

EID: 27644521314     PISSN: 10665277     EISSN: None     Source Type: Journal    
DOI: 10.1089/cmb.2005.12.1117     Document Type: Article

References (21)

1. Angluin, D., and Valiant, L.G. 1979. Fast probabilistic algorithms for Hamiltonian paths and matchings. J. Comp. Syst. Sci. 18, 155-193.
2. Bailey, T.L., and Elkan, C. 1994. Fitting a mixture model by expectation maximization to discover motifs in biopolymers. Proc. 2nd Int. Conf. on Intelligent Systems for Molecular Biology, 28-36.
3. Bailey, T.L., and Elkan, C. 1995. Unsupervised learning of multiple motifs in biopolymers using expectation maximization. Machine Learning 21(1-2), 51-80.
4. Blanchette, M. 2001. Algorithms for phylogenetic footprinting. Proc. 5th Ann. Int. Conf. on Computational Molecular Biology.
5. Blanchette, M., Schwikowski, B., and Tompa, M. 2000. An exact algorithm to identify motifs in orthologous sequences from multiple species. Proc. 8th Int. Conf. on Intelligent Systems for Molecular Biology, 37-45.
6. Brazma, A., Jonassen, I., Vilo, J., and Ukkonen, E. 1998. Predicting gene regulatory elements in silico on a genomic scale. Genome Res. 15, 1202-1215.
7. Buhler, J., and Tompa, M. 2001. Finding motifs using random projections. Proc. 5th Ann. Int. Conf. on Computational Molecular Biology (RECOMB).
8. Chernoff, H. 1952. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals Math. Statistics 23, 493-507.
9. Eskin, E., and Pevzner, P. 2002. Finding composite regulatory patterns in DNA sequences. Bioinformatics S1, 354-363.
10. Galas, D.J., Eggert, M., and Waterman, M.S. 1985. Rigorous pattern-recognition methods for DNA sequences: Analysis of promoter sequences from Escherichia coli. J. Mol. Biol. 186(1), 117-128.
11. Hertz, G., and Stormo, G. 1999. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 15, 563-577.
12. Horowitz, E., Sahni, S., and Rajasekaran, S. 1998. Computer Algorithms, W.H. Freeman Press.
13. Keich, U., and Pevzner, P. 2002. Finding motifs in the twilight zone. Bioinformatics 18, 1374-1381.
14. Lawrence, C.E., Altschul, S.F., Boguski, M.S., Liu, J.S., Neuwald, A.F., and Wootton, J.C. 1993. Detecting subtle sequence signals: A Gibbs sampling strategy for multiple alignment. Science 262, 208-214.
15. Pevzner, P., and Sze, S.-H. 2000. Combinatorial approaches to finding subtle signals in DNA sequences. Proc. 8th Int. Conf. on Intelligent Systems for Molecular Biology, 269-278.
16. Price, A., Ramabhadran, S., and Pevzner, P.A. 2003. Finding subtle motifs by branching from sample strings. Bioinformatics 1(1), 1-7.
17. Rocke, E., and Tompa, M. 1998. An algorithm for finding novel gapped motifs in DNA sequences. Proc. 2nd Int. Conf. on Computational Molecular Biology (RECOMB), 228-233.
18. Sinha, S., and Tompa, M. 2000. A statistical method for finding transcription factor binding sites. Proc. 8th Int. Conf. on Intelligent Systems for Molecular Biology, 344-354.
19. Staden, R. 1989. Methods for discovering novel motifs in nucleic acid sequences. Computer Applications in the Biosciences 5(4), 293-298.
20. Tompa, M. 1999. An exact method for finding short motifs in sequences, with application to the ribosome binding site problem. Proc. 7th Int. Conf. on Intelligent Systems for Molecular Biology, 262-271.
21. van Helden, J., Andre, B., and Collado-Vides, J. 1998. Extracting regulatory sites from the upstream region of yeast genes by computational analysis of oligonucleotide frequencies. J. Mol. Biol. 281(5), 827-842.