메뉴 건너뛰기




Volumn 23, Issue 24, 2007, Pages 3388-3390

DIA-MCIS: An importance sampling network randomizer for network motif discovery and other topological observables in transcription networks

Author keywords

[No Author keywords available]

Indexed keywords

ACCURACY; ARTICLE; COMPUTER NETWORK; FEEDBACK SYSTEM; GENETIC ALGORITHM; GENETIC TRANSCRIPTION; MATHEMATICAL ANALYSIS; MATHEMATICAL COMPUTING; MOLECULAR INTERACTION; MONTE CARLO METHOD; PRIORITY JOURNAL; PROBABILITY; PROTEIN MOTIF; SAMPLING; TOPOGRAPHY;

EID: 36949017205     PISSN: 13674803     EISSN: 13674811     Source Type: Journal    
DOI: 10.1093/bioinformatics/btm454     Document Type: Article
Times cited : (5)

References (15)
  • 1
    • 36948999264 scopus 로고    scopus 로고
    • Structure and evolution of gene regulatory networks
    • Babu,M. et al. (2004) Structure and evolution of gene regulatory networks. Curr. Opin. Struct. Biol., 14, 14-283.
    • (2004) Curr. Opin. Struct. Biol , vol.14 , pp. 14-283
    • Babu, M.1
  • 2
    • 36949036768 scopus 로고    scopus 로고
    • Bekazova,I. et al. (2006) Negative examples for sequential importance sampling of binary contingency tables. Lecture Notes in Computer Science, 4168, Springer, Berlin, pp.136-147.
    • Bekazova,I. et al. (2006) Negative examples for sequential importance sampling of binary contingency tables. Lecture Notes in Computer Science, 4168, Springer, Berlin, pp.136-147.
  • 3
    • 0031313967 scopus 로고    scopus 로고
    • Statistical applications of the Poisson-binomial and conditional Bernoulli distributions
    • Chen,S.X. and Liu,J.S. (1997) Statistical applications of the Poisson-binomial and conditional Bernoulli distributions. Statistica Sinica, 7, 875-892.
    • (1997) Statistica Sinica , vol.7 , pp. 875-892
    • Chen, S.X.1    Liu, J.S.2
  • 4
    • 14944358428 scopus 로고    scopus 로고
    • Sequential Monte Carlo methods for statistical analysis of tables
    • Chen,Y. et al. (2005) Sequential Monte Carlo methods for statistical analysis of tables. J. Am. Stal. Assoc., 100, 109-120.
    • (2005) J. Am. Stal. Assoc , vol.100 , pp. 109-120
    • Chen, Y.1
  • 5
    • 36949014169 scopus 로고    scopus 로고
    • Randomization and feedback properties of directed graphs inspired by gene networks
    • Cosentino Lagomarsino,M. et al. (2006) Randomization and feedback properties of directed graphs inspired by gene networks. q-bio.MN/ 0606039.
    • (2006) q-bio.MN/ 0606039
    • Cosentino Lagomarsino, M.1
  • 6
    • 0036578654 scopus 로고    scopus 로고
    • Topological and causal structure of the yeast transcriptional regulatory network
    • Guelzim,N. et al. (2002) Topological and causal structure of the yeast transcriptional regulatory network. Nat. Genet., 31, 60-63.
    • (2002) Nat. Genet , vol.31 , pp. 60-63
    • Guelzim, N.1
  • 7
    • 4444268694 scopus 로고    scopus 로고
    • Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs
    • Kashtan,N. et al. (2004) Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifs. Bioinformatics, 20, 1746-1758.
    • (2004) Bioinformatics , vol.20 , pp. 1746-1758
    • Kashtan, N.1
  • 8
    • 41349096849 scopus 로고    scopus 로고
    • King,O. D (2004) Comments on Subgraphs in random networks. Phys. Rev.. 058101-1,2,3:E70.
    • King,O. D (2004) Comments on "Subgraphs in random networks". Phys. Rev.. 058101-1,2,3:E70.
  • 9
    • 27744547023 scopus 로고    scopus 로고
    • Computational architecture of the yeast regulatory network
    • Maslov,S. and Sneppen,K. (2005) Computational architecture of the yeast regulatory network. Phys. Biol., 2, 94.
    • (2005) Phys. Biol , vol.2 , pp. 94
    • Maslov, S.1    Sneppen, K.2
  • 10
    • 0037174670 scopus 로고    scopus 로고
    • Network motifs: Simple building blocks of complex networks
    • Milo,R. et al. (2002) Network motifs: Simple building blocks of complex networks. Science, 298, 824.
    • (2002) Science , vol.298 , pp. 824
    • Milo, R.1
  • 11
    • 4444346431 scopus 로고    scopus 로고
    • On the uniform generation of random graphs with prescribed degree sequences
    • cond-mat/0312028
    • Milo,R. et al. (2003) On the uniform generation of random graphs with prescribed degree sequences. cond-mat/0312028.
    • (2003)
    • Milo, R.1
  • 12
    • 1542287343 scopus 로고    scopus 로고
    • Superfamilies of designed and evolved networks
    • Milo,R. et al. (2004) Superfamilies of designed and evolved networks. Science, 303, 1538.
    • (2004) Science , vol.303 , pp. 1538
    • Milo, R.1
  • 13
    • 84990671447 scopus 로고
    • A critical point for random graphs with a given degree sequence
    • Molloy,M. and Reed,B. (1995) A critical point for random graphs with a given degree sequence. Random Structures and Algorithms, 6, 161-179.
    • (1995) Random Structures and Algorithms , vol.6 , pp. 161-179
    • Molloy, M.1    Reed, B.2
  • 14
    • 0000949858 scopus 로고    scopus 로고
    • A Markov chain Monte Carlo method for generating random zero-one matrices with given marginals
    • Rao,A. et al. (1996) A Markov chain Monte Carlo method for generating random zero-one matrices with given marginals. Indian J. Stat., 58, 225.
    • (1996) Indian J. Stat , vol.58 , pp. 225
    • Rao, A.1
  • 15
    • 0036578795 scopus 로고    scopus 로고
    • Network motifs in the transcriptional regulation network of Escherichia coli
    • Shen-Orr,S.S. et al. (2002) Network motifs in the transcriptional regulation network of Escherichia coli. Nat. Genet., 31, 64-68.
    • (2002) Nat. Genet , vol.31 , pp. 64-68
    • Shen-Orr, S.S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.