Research and design of a statistical way for Motif in networks

zbMATH Open1349.05319MaRDI QIDQ2993535FDOQ2993535

Authors: Huayang Tang, Ying Jiang, Haitao Wang 

Publication date: 10 August 2016

Recommendations

• Motif discovery in networks: a survey
• Large-scale network motif analysis using compression
• Detecting local network motifs
• Transactions on Computational Systems Biology III
• Approximating the number of network motifs

zbMATH Keywords

pruningcomplex networksubgraph isomorphism

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Other designs, configurations (05B30)

Cited In (8)

• Large-scale network motif analysis using compression
• An analytical approach to network motif detection in samples of networks with pairwise different vertex labels
• Transactions on Computational Systems Biology III
• Distributed graph-based topology adaptation using motif signatures
• An efficient algorithm for discovering probability motifs in biological networks
• Motif discovery in networks: a survey
• A uniform random graph model for directed acyclic networks and its effect on motif-finding
• An Efficient Sampling Algorithm for Network Motif Detection

This page was built for publication: Research and design of a statistical way for Motif in networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2993535)