Subtle motif discovery for detection of dna regulatory sites

Series on Advances in Bioinformatics and Computational Biology

Volumn 5, Issue , 2007, Pages 27-36

  Comin, Matteo ^a   Parida, Laxmi ^b  

^a UNIVERSITY OF PADOVA   (Italy)

^b IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Binding sites; Consensus motifs; Pattern discovery; Subtle motifs; Transcription factors

Indexed keywords

BENCHMARK DATA; BINDING FACTORS; CONSENSUS MOTIF; FUNCTIONAL DOMAINS; LITMUS TEST; MOTIF DISCOVERY; MULTIPLE SEQUENCES; PATTERN DISCOVERY; SUBTLE MOTIFS;

BINDING SITES; BIOINFORMATICS; TRANSCRIPTION FACTORS;

DNA SEQUENCES;

EID: 84857005866     PISSN: 17516404     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. A. Apostolico, M. Comin, and L. Parida. Conservative extraction of over-represented extensible motifs. ISMB (Supplement of Bioinformatics), 21:9-18, 2005.
2. A. Apostolico and L. Parida. Incremental paradigms for motif discovery. Journal of Computational Biology, 11(4):15-25, 2004.
3. T. L. Bailey and C. Elkan. Fitting a mixture model by expectation maximization to discover motifs in biopolymers. pages 28-36, 1994.
4. Buhler and Tompa. Finding motifs using random projections. In Proceedings of the Annual Conference on Computational Molecular Biology (RECOMB01), pages 69-75. ACM Press, 2001.
5. Eleazar Eskin and Pavel Pevzner. Finding composite regulatory patterns in DNA sequences. In Bioinformatics, volume 18, pages 354-363, 2002.
6. G. Z. Hertz and G. D. Stormo. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics, 15:563-577, 1999.
7. Keich and Pevzner. Finding motifs in the twilight zone. In Annual International Conference on Computational Molecular Biology, pages 195-204, Apr, 2002.
8. Uri Keich and Pavel Pevzner. Subtle motifs: defining the limits of motif finding algorithms. In Bioinformatics, volume 18, pages 1382-1390, 2002.
9. C. E. Lawrence and Reilly A.A. An expectaion maximization (EM) algorithm for the identification and characterization of common sites in unaligned biopolymer sequences. Proteins: Structure, Function and Genetics, 7:41-51, 1990.
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:208-214, Oct, 1993.
11. P. A. Pevzner and S.-H. Sze. Combinatorial approaches to finding subtle signals in DNA sequences. In Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, pages 269-278. AAAI Press, 2000.
12. Alkes Price, Sriram Ramabhadran, and Pavel Pevzner. Finding subtle motifs by branching from sample strings. In Bioinformatics, number 1, pages 149-155, 2003.
13. S. Rajasekaran, S. Balla, and C.-H Huang. Exact algorithms for planted motif problems. Journal of Computational Biology, 12(8):1117-1128, 2005.
14. M. F. Sagot. Spelling approximate repeated or common motifs using a suffix tree. Latin 98: Theoretical Informatics, Lecture Notes in Computer Science, 1380:111-127, 1998.
15. Martin Tompa, Nan Li, Timothy L Bailey, George M Church, Bart De Moor, Eleazar Eskin, Alexander V Favorov, Martin C Frith, Yutao Fu, W James Kent, Vsevolod J Makeev, Andrei A Mironov, William Stafford Noble1, Giulio Pavesi, Graziano Pesole, Mireille Rgnier, Nicolas Simonis, Saurabh Sinha, Gert Thijs, Jacques van Helden, Mathias Vandenbogaert, Zhiping Weng, ChristopherWorkman, Chun Ye, and Zhou Zhu. Assessing computational tools for the discovery of transcription factor binding sites. Nature Biotechnology, 23:137-144, 2005.
16. M.S. Waterman, R. Aratia, and D.J. Galas. Pattern recognition in several sequences: Consensus and alignment. Bulletin of Mathematical Biology, 46(4):515-527, 1984.