Literature DB >> 15600808

Comment on "Subgraphs in random networks".

Oliver D King.   

Abstract

We point out biases in the algorithms used by Itzkovitz et a. [Phys. Rev. E 68, 026127 (2003)] to assess their approximate formulas for the average number of occurrences of certain subgraphs in random graphs with prescribed degree sequences.

Year:  2004        PMID： 15600808     DOI： 10.1103/PhysRevE.70.058101

Source DB:  PubMed          Journal:  Phys Rev E Stat Nonlin Soft Matter Phys        ISSN： 1539-3755


  4 in total

1.  A network-based method for target selection in metabolic networks.

Authors:  R Guimerà; M Sales-Pardo; L A N Amaral
Journal:  Bioinformatics       Date:  2007-04-26       Impact factor: 6.937

2.  IndeCut evaluates performance of network motif discovery algorithms.

Authors:  Mitra Ansariola; Molly Megraw; David Koslicki
Journal:  Bioinformatics       Date:  2018-05-01       Impact factor: 6.937

3.  Extracting labeled topological patterns from samples of networks.

Authors:  Christoph Schmidt; Thomas Weiss; Thomas Lehmann; Herbert Witte; Lutz Leistritz
Journal:  PLoS One       Date:  2013-08-12       Impact factor: 3.240

4.  Sustained-input switches for transcription factors and microRNAs are central building blocks of eukaryotic gene circuits.

Authors:  Molly Megraw; Sayan Mukherjee; Uwe Ohler
Journal:  Genome Biol       Date:  2013-08-23       Impact factor: 13.583
  4 in total

北京卡尤迪生物科技股份有限公司 © 2022-2023.