RecMotif: A novel fast algorithm for weak motif discovery

BMC Bioinformatics

Volumn 11, Issue SUPPL. 11, 2010, Pages

  Sun, He Q ^a   Low, Malcolm Y H ^a   Hsu, Wen J ^a   Rajapakse, Jagath C ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

BIOLOGICAL SEQUENCES; COMPUTATIONAL BIOLOGY; FAST ALGORITHMS; LARGE AMOUNTS; MEMORY-EFFICIENT ALGORITHMS; MOTIF DISCOVERY; NOVEL ALGORITHM; SPACE COMPLEXITY;

BIOINFORMATICS;

ALGORITHMS;

ESCHERICHIA COLI;

ALGORITHM; ARTICLE; BIOLOGY; DNA SEQUENCE; METHODOLOGY; PROBABILITY;

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

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

References (26)

1. Pevzner PA, Sze SH. Combinatorial approaches to finding subtle signals in DNA sequences. Proceedings of the 8th International Conference on Intelligient Systems for Molecular Biology 2000, 269-278.
2. Bailey TL, Elkan C. Fitting a mixture model by expectation maximization to discover motifs in biopolymers. Proceedings of the 2nd International Conference on Intelligent Systems for Molecular Biology 1994, 28-36. Menlo Park, California: AAAI Press.
3. Lawrence CE, Altschul SF. Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science, New Series 1993, 262(5131):208-214.
4. Buhler J, Tompa M. Finding motifs using random projections. Journal of Computational Biology 2002, 9(2):225-242.
5. Rajasekaran S, Balla S, Huang CH. Exact algorithms for planted motif challenge problems. Proceedings of the 3rd Asia-Pacific Bioinformatics Conference 2005, 249-259.
6. Davila J, Balla S, Rajasekaran S. Space and time efficient algorithms for planted motif search. The 6th International Conference on Computational Science (ICCS 2006) / 2nd International Workshop on Bioinformatics Research and Applications (IWBRA 2006) 2006, 822-829.
7. Davila J, Balla S, Rajasekaran S. Fast and practical algorithms for planted (l, d) motif search. IEEE/ACM Transactions on Computational Biology and Bioinformatics 2007, 4(4):544-552.
8. Ho ES, Jakubowski CD, Gunderson SI. iTriplet, a rule-based nucleic acid sequence motif finder. Algorithms for Molecular Biology 2009, 4(14). 2784457, 19874606.
9. Yang X, Rajapakse JC. Graphical approach to weak motif recognition. Genome Informatics Series 2004, 15(2):52-62.
10. Stormo GD, Hartzell GW. Identifying protein-binding sites from unaligned DNA fragments. Proceedings of the National Academy of Sciences 1989, 86:1183-1187. USA.
11. Hertz GZ, Stormo GD. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 1999, 15:563-577.
12. Roth FP, Hughes JD, Estep PW, Church GM. Finding DNA regulatory motifs within unaligned noncoding sequences clustered by whole-genome mRNA quantitation. Nature Biotechnology 1998, 16(10):939-945.
13. Sagot MF. Spelling approximate repeated or common motifs using a suffix tree. Nature Biotechnology 1998, 374-390.
14. Hertz GZ, Hartzell GW, Stormo GD. Identification of consensus patterns in unaligned DNA sequences known to be functionally related. Computer Applications in the Biosciences 1990, 6(2):81-92.
15. Ming L, Bin M, Wang L. Finding similar regions in many sequences. Journal of Computer and System Sciences 1999, 65:73-96.
16. Bussemaker HJ, Li H, Siggia ED. Building a dictionary for genomes: identification of presumptive regulatory sites by statistical analysis. Proceedings of the National Academy of Sciences of the United States of America 2000, 97(18):10096-10100. 27717, 10944202.
17. Keich U, Pevzner PA. Finding motifs in twilight zone. Bioinformatics 2002, 18(10):1374-1381.
18. Sinha S, Tompa M. YMF: a program for discovery of novel transcription factor binding sites by statistical overrepresentation. Nucleic Acids Research 2003, 31(13):3586-3588. 169024, 12824371.
19. Liang S. cWINNOWER algorithm for finding fuzzy DNA motifs. Proceedings of the IEEE Computer Society Conference on Bioinformatics (CSB'03) 2003, 260-265.
20. Price A, Ramabhadran S, Pevzner PA. Finding subtle motifs by branching from sample strings. Bioinformatics 2003, 19(2):ii149-155.
21. 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 Research 2004, 32(Suppl 2):w199-203.
22. Wang G, Yu T, Zhang W. WordSpy: identifying transcription factor binding motifs by building a dictionary and learning a grammar. Nucleic Acids Research 2005, 33(Web Server Issue):w412-416. 1160252, 15980501.
23. Sze SH, Zhao X. Improved pattern-driven algorithms for motif finding in DNA sequences. Proceedings of the 2005 Joint RECOMB Satellite Workshops on Systems Biology and Regulatory Genomics, Lecture Notes in Bioinformatics 2006, 4023:198-211.
24. Fratkin E, Naughton BT, Brutlag DL, Batzoglou S. MotifCut: regulatory motifs finding with maximum density subgraphs. Bioinformatics 2006, 22(14):e150-157.
25. Yao Z, Weinberg Z, Ruzzo WL. CMfinder-a covariance model based RNA motif finding algorithm. Bioinformatics 2006, 22(4):445-452.
26. Wijaya E, Siu, Ngo, Kanagasabai R, Wing. MotifVoter: a novel ensemble method for fine-grained integration of generic motif finders. Bioinformatics 2008, 24(20):2288-2295.