A fast weak motif-finding algorithm based on community detection in graphs

BMC Bioinformatics

Volumn 14, Issue 1, 2013, Pages

  Jia, Caiyan ^a,b   Carson, Matthew B ^b   Yu, Jian ^a  

^a BEIJING JIAOTONG UNIVERSITY   (China)

^b UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNITY DETECTION; EMPIRICAL STUDIES; GENETIC REGULATION; PROKARYOTIC PROMOTERS; REAL APPLICATIONS; SPACE COMPLEXITY; STATE-OF-THE-ART ALGORITHMS; TRANSCRIPTION FACTOR BINDING SITES;

DNA SEQUENCES; ESCHERICHIA COLI; HEURISTIC ALGORITHMS; TRANSCRIPTION FACTORS;

POPULATION DYNAMICS;

ESCHERICHIA COLI; PROKARYOTA;

DNA; TRANSCRIPTION FACTOR;

ALGORITHM; ANIMAL; ARTICLE; BINDING SITE; CHEMISTRY; DNA SEQUENCE; ESCHERICHIA COLI K 12; GENETICS; METABOLISM; METHODOLOGY; MOUSE; NUCLEOTIDE MOTIF; PROMOTER REGION; PROCEDURES;

ALGORITHMS; ANIMALS; BINDING SITES; DNA; ESCHERICHIA COLI K12; MICE; NUCLEOTIDE MOTIFS; PROMOTER REGIONS, GENETIC; SEQUENCE ANALYSIS, DNA; TRANSCRIPTION FACTORS;

EID: 84880183393     PISSN: None     EISSN: 14712105     Source Type: Journal    
DOI: 10.1186/1471-2105-14-227     Document Type: Article

References (58)

1. Elnitski L, Jin VX, Farnham PJ, Jones SJ. Locating mammalian transcription factor binding sites: a survey of computational and experimental techniques. Genome Res 2006, 16(12):1455-1464.
2. Jensen ST, Liu XS, Zhou Q, Liu JS. Computational discovery of gene regulatory binding motifs: a Bayesian perspective. Stat Sci 2004, 19:188-204.
3. Pavesi G, Mauri G, Pesole G. In silico representation and discovery of transcription factor binding sites. Brief Bioinformatics 2004, 5(3):217-236.
4. Das MK, Dai HK. A survey of DNA motif finding algorithms. BMC Bioinformatics 2007, 8(Suppl 7):S21.
5. Hertz GZ, Stormo GD. Identifying DNA and protein patterns with statistically significant alignments of multiple sequences. Bioinformatics 1999, 15:563-577.
6. Bailey TL, Elkan C. Fitting a mixture model by expectation maximization to discover motifs in biopolymers. Proceedings of the Second International Conference on Intelligent Systems for Molecular Biology, 1994 1994, 28-36. Menlo Park.
7. Lawrence CE, Altschul SF, Boguski MS, Liu JS, Neuwald AF, Wootton JC. Detecting subtle sequence signals: a Gibbs sampling strategy for multiple alignment. Science 1993, 262:208-214.
8. Hughes JD, Estep PW, Tavazoie S, Church GM. Computational identification of cis-regulatory elements associated with groups of functionally related genes in Saccharomyces cerevisiae. J Mol Biol 2000, 296(5):1205-1214.
9. Buhler J, Tompa M. Finding motifs using random projections. J Comput Biol 2002, 9(2):225-242.
10. Gang L, Chan TM, Leung KS, Lee KH. Cluster refinement algorithm for motif discovery. IEEE/ACM Trans Comput Biol Bioinformatic 2010, 7(4):654-668.
11. Pevzner P, Sze S. Combinatorial approaches to finding subtle signals in DNA sequences. Proceedings of the Eighth International Conference on Intelligent Systems for Molecular Biology, 2000 2000, 269-278. California, USA.
12. Rajasekaran S, Dinh H. A speedup technique for (l, d)-motif finding algorithms. BMC Res Notes 2011, 4(54).
13. Sagot MF. Spelling approximate repeated or common motifs using a suffix tree. Proc LATIN'98: Theor Inf, LNCS 1998, 1380:111-127.
14. Pavesi G, Mauri G, Pesole G. An algorithm for finding signals of unknown length in DNA sequences. Bioinformatics 2001, 17(Suppl 1):207-214.
15. 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(Suppl 2):W199-W203.
16. Eskin E, Pevzner P. Finding composite regulatory patterns in DNA sequences. Bioinformatics 2002, 18(Suppl 1):354-363.
17. Chin YL, Leung CM. Voting algorithms for discovering long motifs. Proceedings of the Third Asia-Pacific Bioinformatics Conference, 2005 2005, 261-271. Singapore.
18. Davila J, Balla S, Rajasekaran S. Fast and practical algorithms for planted (l, d) motif search. IEEE/ACM Trans Comput Biol Bioinformatics 2007, 4:544-552.
19. Ho ES, Jakubowski CD, Gunderson SI. iTriplet, a rule-based nucleic acid sequence motif finder. Algorithms Mol Biol 2009, 4(14).
20. Huang CW, Lee WS, Hsieh SY. An improved heuristic algorithm for finding motif signals in DNA sequences. IEEE/ACM Trans Comput Biol Bioinformatics 2010, 8(4):959-975.
21. Kuksa PP, Pavlovic V. Efficient motif finding algorithms for large-alphabet inputs. BMC Bioinformatics 2010, 1(Suppl 8):S1.
22. Sun HQ, Low MYH, Hsu WJ, Rajapakse JC. RecMotif: a novel fast algorithm for weak motif discovery. BMC Bioinformatics 2010, 11(Suppl 11):S8.
23. Boucher C, King J. Fast motif recognition via application of statistical thresholds. BMC Bioinformatics 2010, 11(Suppl 1):S11.
24. Tompa M. Assessing computational tools for the discovery of transcription factor binding sites. Nat Biotechnol 2005, 23:137-144.
25. Hu J, Li B, Kihara D. Limitations and potentials of current motif discovery algorithms. Nucleic Acids Res 2005, 33(15):4899-4913.
26. Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E. Fast unfolding of communities in large networks. J Stat Mech: Theory Exp 2008, 2008(10):P10008.
27. Salgado H, Castro SG, Antonio AM, Peredo ED, Solano FS, Gil MP, Alonso DG, Jacinto VJ, Zavaleta AS, Martinez CB, Vides JC. RegulonDB (version 4.0): transcriptional regulation, operon organization and growth conditions in Escherichia coli K-12. Nucleic Acids Res 2004, 32:D303-D306.
28. Chen X, Xu H, et A. Integration of external signaling pathways with the core transcriptional network in embryonic stem cells. Cell 2008, 133:1106-1117.
29. Zia A, Moses AM. Towards a theoretical understanding of false positives in DNA motif finding. BMC Bioinformatics 2012, 13(151).
30. Li GJ, Liu BQ, Xu Y. A new framework for identifying cis-regulatory motifs in prokaryotes. Nucleic Acids Res 2011, 39(7):e42.
31. Crooks GE, Hon G, Chandonia JM, Brenner SE. WebLogo: a sequence logo generator. Genome Res 2004, 14:1188-1190.
32. Favorov AV, Gelfand MS, Gerasimova AV, Mironov AA, Makeev VJ. A Gibbs sampler for identification of symmetrically structured, spaced DNA motifs with improved estimation of the signal length. Bioinformatics 2005, 21(10):2240-2245.
33. Bulyk ML, McGuire AM, Masuda N, Church GM. A motif co-occurrence approach for genome-wide prediction of transcription-factor-binding sites in Escherichia coli. Genome Res 2004, 14:201-208.
34. Cameron ADS, Redfield RJ. CRP binding and transcription activation at CRP-S sites. J Mol Biol 2008, 383:313-323.
35. Gavigan SA, Nguyen T, Nguyen N, Senear F. Role of multiple CytR binding sites on cooperativity, competition, and induction at the Escherichia coli udp promoter. J Biol Chem 1999, 274(23):16010-16019.
36. Sammitt CE, Hansen FG, Miller JF, Schaechter M. In vivo studies of DnaA binding to the origin of replication of Escherichia coli. EMBO J 1989, 8(3):989-993.
37. Campbell JW, Cronan E. Escherichia coli FadR positively regulates transcription of the fabB fatty acid biosynthetic gene. J Bacteriol 2001, 183(20):5982-5990.
38. Robison K, McGuire AM, Church GM. A comprehensive library of DNA-binding site matrices for 55 proteins applied to complete Escherichia coli K-12 genome. J Mol Biol 1998, 284:241-254.
39. Hengen PN, Bartram S, Stewart LE, Schneider TD. Information analysis of Fis binding sites. Nucleic Acids Res 1997, 25(24):4994-5002.
40. Nègre D, Bidaud CB, Geourjon G, Delèage G, Cozzone AJ, Cortay JC. Definition of a consensus DNA-binding site for the Escherichia coli pleiotropic regulatory protein, FruR. Mol Microbiol 1996, 21(2):257-266.
41. Lavrrar JL, McIntosh MA. Architecture of a Fur binding site: a comparative analysis. J Bacteriol 2003, 185(7):2194-2202.
42. Tramonti A, Canio MD, Biase DD. GadX/GadW-dependent regulation of the Escherichia coli acid fitness island: transcriptional control at the gadY-gadW divergent promoters and identification of four novel 42 bp GadX/GadW-specific binding sites. Mol Microbiol 2008, 70(4):965-982.
43. Cui Y, Wang Q, Stormo GD, Calvo JM. A consensus sequence for binding of Lrp to DNA. J Bacteriol 1995, 177(17):4872-4880.
44. Danot O, Raibaud O. On the puzzling arrangement of the asymmetric MalT-binding sites in the MalT-dependent promoters. Proc Natl Acad Sci USA 1993, 90:10999-11003.
45. Schneiders T, Levy SB. MarA-mediated transcriptional repression of the rob promoter. J Biol Chem 2006, 281:10049-10055.
46. Plumbridge J. DNA binding sites for the Mlc and NagC proteins: regulation of nagE, encoding the N-acetylglucosamine-specific transporter in Escherichia coli. Nucleic Acids Res 2001, 29(2):506-514.
47. McNicholas PM, Rech SA, Gunsalus RP. Characterization of the ModE DNA-binding sites in the control regions of modABCD and moaABCDE of Escherichia coli. Mol Microbiol 1997, 23(3):515-524.
48. Ames GF, Nikaido K. Nitrogen regulation in Salmonella typhimurium. Identification of a ntrC protein-binding site and definition of a consensus binding sequence. EMBO J 1985, 4(2):539-547.
49. Cho BK, Federowicz SA, et A. The PurR regulon in Escherichia coli K-12 MG1655. Nucleic Acids Res 2011, 39(15):6456-6464.
50. Zhang Y, et al. Model-based analysis of ChIP-Seq (MACS). Genome Biol 2008, 9:R137.
51. Georgiev S, Boyle AP, Jayasurya K, Ding X, Mukherjee S, Ohler U. Evidence-ranked motif identification. Genome Biol 2010, 11(2):R19.
52. Sharov AA, Ko MSH. Exhaustive search for over-represented DNA sequence motif with CisFinder. DNA Res 2009, 16:261-273.
53. Girvan M, Newman MJ. Community structure in social and biological network. Proc Nat Acad Sci 2002, 99:7821-7826.
54. Fortunato S. Community detection in graphs. Phys Rep 2010, 486:75-174.
55. Rosvall M, Bergstrom CT. Maps of random walks on complex networks reveal community structures. Proc Nat Acad Sci 2008, 105:1118-1123.
56. Raghavan UN, Albert R, Kumara S. Near linear time algorithm to detect community structure in large-scale networks. Phys Rev E 2007, 76:036106.
57. Ovelgonne M, Schulz AG, Stein M. Randomized greedy modularity optimization for group detection in huge social networks. Proceedings of the fourth SNA-KDD Workshop, KDD 2010, July 25 2010, 1-9. Washington D.C USA.
58. Newman MJ, Girvan M. Finding and evaluating community structure in networks. Phys Rev E 2004, 69:026113.