Algorithms for motif search

Handbook of Computational Molecular Biology

Volumn , Issue , 2005, Pages 37.1-37.21

  Rajasekaran, Sanguthevar ^a  

^a UNIVERSITY OF CONNECTICUT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85145638548     PISSN: None     EISSN: None     Source Type: Book    
DOI: None     Document Type: Chapter

References (43)

1. E.F. Adebiyi, T. Jiang and M. Kaufmann, An efficient algorithm for finding short approximate non-tandem repeats, Bioinformatics 17, Supplement 1, 2001, pp. S5-S12.
2. E.F. Adebiyi and M. Kaufmann, Extracting common motifs under the Levenshtein measure: theory and experimentation, Proc. Workshop on Algorithms for Bioinformatics (WABI), Springer-Verlag LNCS 2452, 2002, pp. 140-156.
3. T.L. Bailey and C. Elkan, Fitting a mixture model by expectation maximization to discover motifs in biopolymers, Proc. Second International Conference on Intelligent Systems for Molecular Biology, 1994, pp. 28-36.
4. 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.
5. M. Blanchette, Algorithms for phylogenetic footprinting, Proc. Fifth Annual International Conference on Computational Molecular Biology, 2001.
6. 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.
7. 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.
8. J. Buhler and M. Tompa, Finding motifs using random projections, Proc. Fifth Annual International Conference on Computational Molecular Biology (RECOMB), April 2001.
9. H. Chernoff, A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations, Annals of Math. Statistics 23, 1952, pp. 493-507.
10. M. Crochemore and M.-F. Sagot, Motifs in sequences: localization and extraction, in Handbook of Computational Chemistry, Crabbe, Drew, Konopka, eds., Marcel Dekker, Inc., 2001.
11. E. Eskin and P. Pevzner, Finding composite regulatory patterns in DNA sequences, Bioinformatics S1, 2002, pp. 354-363.
12. D.J. Galas, M. Eggert, and M.S. Waterman, Rigorous pattern-recognition methods for DNA sequences: Analysis of promoter sequences from Escherichia coli, Journal of Molecular Biology 186(1), 1985, pp. 117-128.
13. Z. Galil and K. Park, An improved algorithm for approximate string matching, SIAM Journal of Computing 19(6), 1990, pp. 989-999.
14. Y. Gao, M. Yang, X. Wang and K. Mathee et al, Detection of HTH Motifs via Data Mining, Proceedings of SPIRE99: String Processing and Information Retrieval, 1999, pp. 63-72.
15. M. Gribskov, R. Luthy, and D. Eisenberg, Profile anlysis, in R. F. Doolittle (Ed.), Molecular Evolution: Computer Analysis of Protein and Nucleic Acid Sequences, volume 183 of Methods in Enzymology, Academic Press, 1990, pp. 146-159.
16. M. Gribskov and S. Veretnik, Identification of sequence pattern with profile analysis, Methods Enzymol. 266, 1996, pp. 198-212.
17. G. Hertz and G. Stormo, Identifying DNA and protein patterns with statistically significant alignments of multiple sequences, Bioinformatics 15, 1999, pp. 563-577.
18. E. Horowitz, S. Sahni, and S. Rajasekaran, Computer Algorithms, W.H. Freeman Press, 1998.
19. U. Keich and P. Pevzner, Finding motifs in the twilight zone, Bioinformatics 18, 2002, pp. 1374-1381.
20. G.M. Landau and U. Vishkin, Introducing efficient parallelism into approximate string matching and a new serial algorithm, Proc. ACM Symposium on Theory of Computing, 1986, pp. 220-230.
21. C.E. Lawrence, S.F. Altschul, M.S. Boguski and J.S. Liu et al, Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment, Science 262, 1993, pp. 208-214.
22. C.E. Lawrence and A.A. Reilly, An Expectation Maximization (EM) Algorithm for the Identification and Characterization of Common Sites in Unaligned Biopolymer Sequences, Proteins: Structure, Function, and Genetics 7, 1990, pp. 41-51.
23. H.M. Martinez, An efficient method for finding repeats in molecular sequences, Nucleic Acids Research 11(13), 1983, pp. 4629-4634.
24. K. Mathee and G. Narasimhan, Detection of DNA-binding helix-turn-helix motifs in proteins using the pattern dictionary method, Methods Enzymol., 370, 2003, pp. 250-264.
25. E.W. Myers, Incremental alignment algorithms and their applications, Technical Report 86-22, Department of Computer Science, University of Arizona, Tucson, AZ 85721, 1986.
26. E.W. Myers, A sublinear algorithm for approximate keyword searching, Algorithmica 12, 1994, pp. 345-374.
27. G. Narasimhan, C. Bu, Y. Gao and X. Wang et al, Mining Protein Sequences for Motifs, Journal of Computational Biology, 9(5), 2002, pp. 707-720.
28. C.G. Nevill-Manning, T.D. Wu, and D.L. Brutlag, Highly-specific protein sequence motifs for genome analysis, Proc. Natl. Acad. Sci. USA, 95, 1998, pp. 5865-5871.
29. G. Pavesi, G. Mauri, and G. Pesole, In silico representation and discovery of transcription factor binding sites, Brief Bioinform., 5(3), 2004, pp. 217-36.
30. 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.
31. A. Price, S. Ramabhadran and P.A. Pevzner, Finding subtle motifs by branching from sample strings, Bioinformatics 1(1), 2003, pp. 1-7.
32. S. Rajasekaran, S. Balla, C.-H. Huang, Exact Algorithms for Planted Motif Challenge Problems, Proc. Third Asia-Pacific Bioinformatics Conference, Singapore, 2005.
33. S. Rajasekaran, S. Balla, C.-H. Huang and V. Thapar et al, Exact Algorithms for Motif Search, Proc. Third Asia-Pacific Bioinformatics Conference, Singapore, 2005.
34. I. Rigoutsos and A. Floratos, Combinatorial pattern discovery in biological sequences: The TEIRESIAS algorithm, Bioinformatics, 14(1), 1998, pp. 55-67. Erratum in: Bioinformatics 14(2), 1998, p. 229.
35. E. Rocke and M. Tompa, An algorithm for finding novel gapped motifs in DNA sequences, Proc. Second International Conference on Computational Molecular Biology (RECOMB), 1998, pp. 228-233.
36. M.F. Sagot, Spelling approximate repeated or common motifs using a suffix tree, Springer-Verlag LNCS 1380, pp. 111-127, 1998.
37. 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.
38. R. Staden, Methods for discovering novel motifs in nucleic acid sequences, Computer Applications in the Biosciences 5(4), 1989, pp. 293-298.
39. G.D. Stormo, DNA binding sites: representation and discovery, Bioinformatics, 16(1), 2000, pp. 16-23.
40. M. Tompa, An exact method for finding short motifs in sequences, with application to the ribosome binding site problem, Proc. Seventh International Conference on Intelligent Systems for Molecular Biology, 1999, pp. 262-271.
41. E. Ukkonen, Finding approximate patterns in strings, Journal of Algorithms 6, 1985, pp. 132-137.
42. 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.
43. M. Waterman, R. Arratia, and E. Galas, Pattern Recognition in Several Sequences: Consensus and Alignment, Bulletin of Mathematical Biology 46, 1984, pp. 515-527.