Allostery is one of most important processes in molecular biology by which proteins transmit the information from one functional site to another, frequently distant site. The information on ligand binding or on posttranslational modification at one site is transmitted along allosteric communication path to another functional site allowing for regulation of protein activity. The detailed analysis of the general character of allosteric communication paths is therefore extremely important. It enables to better understand the mechanism of allostery and can be used in for the design of new generations of drugs. Considering all the PDB annotated allosteric proteins (from ASD more »
Nimber Sequences of NodeKayles Games
NodeKayles is an impartial game played on a simple graph. The SpragueGrundy
theorem states that every impartial game is associated with a nonnegative integer
value called a Nimber. This paper studies the Nimber sequences of various families of
graphs, including 3paths, lattice graphs, prism graphs, chained cliques, linked cliques,
linked cycles, linked diamonds, hypercubes, and generalized Petersen graphs. For most
of these families, we determine an explicit formula or a recursion on their Nimber
sequences.
 Award ID(s):
 1852378
 Publication Date:
 NSFPAR ID:
 10141270
 Journal Name:
 Journal of integer sequences
 Volume:
 23
 ISSN:
 15307638
 Sponsoring Org:
 National Science Foundation
More Like this


Abstract Main results of the paper are as follows: (1) For any finite metric space $M$ the Lipschitzfree space on $M$ contains a large wellcomplemented subspace that is close to $\ell _{1}^{n}$ . (2) Lipschitzfree spaces on large classes of recursively defined sequences of graphs are not uniformly isomorphic to $\ell _{1}^{n}$ of the corresponding dimensions. These classes contain wellknown families of diamond graphs and Laakso graphs. Interesting features of our approach are: (a) We consider averages over groups of cyclepreserving bijections of edge sets of graphs that are not necessarily graph automorphisms. (b) In the case of such recursive familiesmore »

Quasicliques are a type of dense subgraphs that generalize the notion of cliques, important for applications such as community/module detection in various social and biological networks. However, the existing quasiclique definition and algorithms are only applicable to undirected graphs. In this paper, we generalize the concept of quasicliques to directed graphs by proposing $(\gamma_1, \gamma_2)$quasicliques which have density requirements in both inbound and outbound directions of each vertex in a quasiclique subgraph. An efficient recursive algorithm is proposed to find maximal $(\gamma_1, \gamma_2)$quasicliques which integrates many effective pruning rules that are validated by ablation studies. We also study the findingmore »

We study a class of linearquadratic stochastic differential games in which each player interacts directly only with its nearest neighbors in a given graph. We find a semiexplicit Markovian equilibrium for any transitive graph, in terms of the empirical eigenvalue distribution of the graph’s normalized Laplacian matrix. This facilitates largepopulation asymptotics for various graph sequences, with several sparse and dense examples discussed in detail. In particular, the mean field game is the correct limit only in the dense graph case, that is, when the degrees diverge in a suitable sense. Although equilibrium strategies are nonlocal, depending on the behavior ofmore »

Quasicliques are dense incomplete subgraphs of a graph that generalize the notion of cliques. Enumerating quasicliques from a graph is a robust way to detect densely connected structures with applications in bioinformatics and social network analysis. However, enumerating quasicliques in a graph is a challenging problem, even harder than the problem of enumerating cliques. We consider the enumeration of top k degreebased quasicliques and make the following contributions: (1) we show that even the problem of detecting whether a given quasiclique is maximal (i.e., not contained within another quasiclique) is NPhard. (2) We present a novel heuristic algorithm K ernel QC tomore »