Talk:Network motif

Definition is incomplete

First sentence of definition:

Let and be two graphs, graph G′ is a sub-graph of graph G (written as G′ ⊆ G) if V′ ⊆ V and E′ ⊆ E ∩ (V′ × V′).

What is V? What is E? What is the cross operator for graphs? What is the intersect operator? What does this sentence mean?

--Ar-Pharazôn (talk) 19:19, 15 April 2013 (UTC)

The cross operator is the set theoretic Cartesian product, which, apparently, should be evident from the use of the subset symbol, ⊆. For more information I refer you to the "basic concepts and notation" section of the Wikipedia article on set theory.

Boris Breuer (talk) 11:58, 26 October 2013 (UTC)

Error

The first sentence of the Definition starts as "Let {{{1}}} and {{{1}}} be two graphs". The {{{1}}} should have a special meaning in the Wiki source? There are many {{{1}}}-s in the description of the picture as well. -- Harp (talk) 17:19, 4 July 2013 (UTC)

First paragraph

I believe there is a problem in the very first paragraph: "All networks, including biological networks, social networks, technological networks (e.g., computer networks and electrical circuits) and more, can be represented as graphs, which include a wide variety of subgraphs. One important local property of networks are so-called network motifs, which are defined as recurrent and statistically significant sub-graphs or patterns."

As far as I know, network motifs is a term just applied in gene expression, in the best case, biological networks. See that there is no reference for that claim, for mine I have several (e.g. Sara Green. Revisiting Generality in Biology: Systems Biology and the Quest for Design Principles ). I propose to add the term biological network instead of networks:

New Sentence:

"All networks, including biological networks, social networks, technological networks (e.g., computer networks and electrical circuits) and more, can be represented as graphs, which include a wide variety of subgraphs. One important local property of biological networks are so-called network motifs, which are defined as recurrent and statistically significant sub-graphs or patterns." and cite Green and Alon, the latter is already present in the reference list.

Jorge Pires (talk) 14:45, 23 August 2015 (UTC)

It would make no sense to limit a theoretical article like this to biological networks, since motifs are useful for a huge variety of networks. And there are citations dealing with communication and transportation networks e.g. https://www.nature.com/articles/srep11926 ★NealMcB★ (talk) 20:20, 11 September 2020 (UTC)

Applications

Forgive me if this hasn't been covered in the article but I really feel that a section on applications should be included. There is a lot of research out there covering this topic including some cutting-edge work done with Wikipedia! Spacejunkjim (talk) 10:55, 30 August 2019 (UTC)

Change "sub-graph" to "subgraph"

The definition on Wikipedia for the term "sub-graph" shows up at Glossary_of_graph_theory_terms#Subgraphs. There are about 10 times as many hits on Google for the non-hyphenated form also, and this article already uses "subgraph" over a quarter of the time. I suggest changing them all for consistency. ★NealMcB★ (talk) 20:31, 11 September 2020 (UTC)

Update with new algorithms - e.g. details on ParaMODA and NemoMap

It looks like the article needs an update with some of the latest algorithms in this fast-moving world. See a 2020 review at https://ieeexplore.ieee.org/document/9150079 ★NealMcB★ (talk) 22:52, 11 September 2020 (UTC)