Approximating the Number of Network Motifs
Authors:
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 13-24
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Efficient semi-streaming algorithms for local triangle counting in massive graphs2008
- Semi-Automatic Classification of Skeletal Morphology in Genetically Altered Mice Using Flat-Panel Volume Computed TomographyPLOS Genetics, 2007
- Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking2007
- Biological network comparison using graphlet degree distributionBioinformatics, 2007
- QNet: A Tool for Querying Protein Interaction Networks2007
- Balanced Families of Perfect Hash Functions and Their Applications2007
- Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifsBioinformatics, 2004
- Approximation Algorithms for Some Parameterized Counting Problems2002
- Network Motifs: Simple Building Blocks of Complex NetworksScience, 2002
- Color-codingJournal of the ACM, 1995