Network Motif Discovery Using Subgraph Enumeration and Symmetry-Breaking

By Joshua A. Grochow, Manolis Kellis. Annual International Conference on Research in Computational Molecular Biology, 2007

327 citations recorded by the source corpus.

Subfields: Molecular Biology

View Paper: https://www.semanticscholar.org/paper/b4ad82eb13a4e103d0f2ee240f89b667dc55acd9

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Molecular Biology

1. Min Wu
2. David D. Jensen
3. Chee Keong Kwoh
4. Tom Michoel
5. D. Towsley
6. See-Kiong Ng
7. Xiaoli Li

Citations in the corpus

• Resisting structural re-identification in anonymized social networks (2008, background): “Efficient algorithms for this problem are currently under investigation [13].”
• Computational approaches for detecting protein complexes from protein interaction networks: a survey (2010, background): “The fact that many graph-based problems, such as subgraph isomorphisms [99,100] and enumeration [101,102], are NP-hard [103,104], indicates that mining the PPI networks is intrinsically computationally challenging.”
• The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees (2013, background): “In the future, we plan to take into account all sorts of symmetries (like the algorithm of [27] does).”