Article citationsMore>>

T. S. Motzkin and E. G. Straus, “Maxima for Graphs and a New Proof of a Theorem of Turán,” Canadian Journal of Mathematics, Vol. 17, 1965, pp. 533-540. doi:10.4153/CJM-1965-053-6

has been cited by the following article:

• TITLE: A Clique-Based Approach to the Identification of Common Gene Association Sub-Networks

  AUTHORS: Gaolin Zheng, Assefa Tesfay, Xinyu Huang, Alade Tokuta

  KEYWORDS: Graphical Lasso Model; Quadratic Maximization; Subgraph Isomorphism; Clique; Replicator Equation; Gene Association Network

  JOURNAL NAME: Applied Mathematics, Vol.4 No.6, June 4, 2013

  ABSTRACT: We developed a computational framework to identify common gene association sub-network. This framework combines graphical lasso model, graph product and a replicator equation based clique solver. We applied this method to find common stress responsive sub-networks from two related Deinococcus-Thermus bacterial species.