Fast motif recognition via application of statistical thresholds

BMC Bioinformatics

Volumn 11, Issue SUPPLL.1, 2010, Pages

  Boucher, Christina ^a   King, James ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL BOTTLENECKS; COMPUTATIONAL CHALLENGES; DECISION PROBLEMS; GENOMIC DATA SETS; ORDERS OF MAGNITUDE; PROBABILITY OF ERRORS; STATISTICAL THRESHOLD; TRANSCRIPTION FACTOR BINDING SITES;

GENES; HAMMING DISTANCE; TRANSCRIPTION FACTORS; BIOINFORMATICS;

HEURISTIC PROGRAMMING;

ALGORITHM; ARTICLE; AUTOMATED PATTERN RECOGNITION; DNA SEQUENCE; METHODOLOGY; NUCLEOTIDE SEQUENCE; STATISTICAL MODEL;

ALGORITHMS; CONSERVED SEQUENCE; MODELS, STATISTICAL; PATTERN RECOGNITION, AUTOMATED; SEQUENCE ANALYSIS, DNA;

EID: 75149127766     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-11-S1-S11     Document Type: Article

References (22)

1. Pevzner P, Sze S. Combinatorial approaches to finding subtle signals in DNA strings. Proc ISMB 2000 2000, 269-278.
2. Tompa M, Li N, Bailey TL, Church GM, De Moor B, Eskin E, Favorov AV, Frith MC, Fu Y, Kent WJ, et al. Assessing computational tools for the discovery of transcription factor binding sites. Nat Biotechnol 2005, 23:137-144. 10.1038/nbt1053, 15637633.
3. Evans PA, Smith A, Wareham HT. On the complexity of finding common approximate substrings. Theor Comput Sci 2003, 306(1-3):407-430.
4. Buhler J, Tompa M. Finding motifs using random projections. J Comput Biol 2002
5. Sze S, Lu S, Chen J. Integrating sample-driven and patter-driven approaches in motif finding. Proc WABI 2004 2004, 438-449.
6. Eskin E, Pevzner P. Finding composite regulatory patterns in DNA strings. Bioinformatics 2002, 18(Suppl 1):S354-S363.
7. Rajasekaran S, Balla S, Huang CH. Exact algorithms for planted motif problems. J Comput Biol 2005, 12(8):1117-1128. 10.1089/cmb.2005.12.1117, 16241901.
8. Davila J, Balla S, Rajasekaran S. Fast and practical algorithms for planted (l, d) motif search. TCBB 2007, 4(4):544-552.
9. Chin FYL, Leung CM. Voting algorithms for discovering long motifs. Proc APBC 2005 2005, 261-271.
10. Boucher C, Church P, Brown D. A graph clustering approach to weak motif recognition. Proc WABI 2007 2007, 149-160.
11. Bailey TL, Elkan C. The value of prior knowledge in discovering motifs with MEME. Proc ISMB 1995 1995, 21-29.
12. Chin FYL, Leung CM. An efficient algorithm for string motif discovery. Proc APBC 2006 2006, 79-88.
13. Pisanti N, Carvalho A, Marsan L, Sagot MF. RISOTTO: Fast extraction of motifs with mismatches. Proc LATIN 2006 2006, 757-768.
14. Pavesi G, Mereghetti P, Mauri G, Pesole G. Weeder Web: discovery of transcription factor binding sites in a set of sequences from co-regulated genes. Nucleic Acids Res 2004, 32(Web Server issue):W199-W203. 10.1093/nar/gkh465, 441603, 15215380.
15. Li M, Ma B, Wang L. Finding similar regions in many strings. J Comput Syst Sci 2002, 65:73-96.
16. Frances M, Litman A. On covering problems of codes. Theor Comput Syst 1997, 30(2):113-119.
17. Feng WS, Wang Z, Wang L. Identification of distinguishing motifs. Proc CPM 2007 2007, 253-264.
18. Boucher C, Brown D. Detecting motifs in a large data set: applying probabilistic insights to motif finding. Proc BICoB 2009 2009, 139-150.
19. van Dongen S. Graph clustering by flow simulation. PhD thesis 2000, University of Utrecht.
20. Wingender E, Dietze P, Karas H, Knüppel R. TRANSFAC: a database on transcription factors and their DNA binding sites. Nucleic Acids Res 1996, 24:238-241. 10.1093/nar/24.1.238, 145586, 8594589.
21. Ben-Gal I, Shani A, Gohr A, Grau A, Grau J, Arviv S, Shmilovici A, Posch S, Grosse I. Identification of transcription factor binding sites with variable-order Bayesian networks. Bioinformatics 2005, 21(11):2657-2666. 10.1093/bioinformatics/bti410, 15797905.
22. Frith MC, Hansen U, Spouge JL, Weng Z. Finding functional sequence elements by multiple local alignment. Nucleic Acids Res 2004, 32:189-200. 10.1093/nar/gkh169, 373279, 14704356.