An efficient algorithm for discovering probability motifs in biological networks

DOI10.3969/J.ISSN.1001-0505.2012.01.007MaRDI QIDQ4900823zbMATH OpenFDO

Authors Jieyue He, Dejing Zhao

Publication date 24 January 2013

Full work available at URL https://doi.org/10.3969/J.ISSN.1001-0505.2012.01.007

zbMATH Keywords

genetic algorithmsimulated annealing algorithmsubgraph mining

Mathematics Subject Classification ID

Applications of graph theory (05C90) Probabilistic models, generic numerical methods in probability and statistics (65C20) Applications of mathematical programming (90C90) Computational methods for problems pertaining to biology (92-08) Systems biology, networks (92C42)

Recommendations

• Motif discovery in networks: a survey
• Searching and inferring colorful topological motifs in vertex-colored graphs
• Research and design of a statistical way for Motif in networks
• Large-scale network motif analysis using compression
• Discovering Almost Any Hidden Motif from Multiple Sequences in Polynomial Time with Low Sample Complexity and High Success Probability

Cited in

(4)

• An Efficient Sampling Algorithm for Network Motif Detection
• An Important Connection Between Network Motifs and Parsimony Models
• A uniform random graph model for directed acyclic networks and its effect on motif-finding
• Finding pathway structures in protein interaction networks

This page was built for publication: An efficient algorithm for discovering probability motifs in biological networks

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