A Faster Algorithm for Detecting Network Motifs
Author:
- 1 January 2005
- book chapter
- Published by Springer Nature
- p. 165-177
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Coarse-graining and self-dissimilarity of complex networksPhysical Review E, 2005
- Local graph alignment and motif search in biological networksProceedings of the National Academy of Sciences, 2004
- Comment on "Network Motifs: Simple Building Blocks of Complex Networks" and "Superfamilies of Evolved and Designed Networks"Science, 2004
- Conserved network motifs allow protein–protein interaction predictionBioinformatics, 2004
- Efficient sampling algorithm for estimating subgraph concentrations and detecting network motifsBioinformatics, 2004
- Subgraphs in random networksPhysical Review E, 2003
- Transcriptional Regulatory Networks in Saccharomyces cerevisiaeScience, 2002
- A Fast Approximation Algorithm for Computing the Frequencies of Subgraphs in a Given GraphSIAM Journal on Computing, 1995
- The asymptotic number of labeled graphs with given degree sequencesJournal of Combinatorial Theory, Series A, 1978
- The asymptotic number of non-negative integer matrices with given row and column sumsDiscrete Mathematics, 1974