Results 71 to 80 of about 2,991,925 (319)
Knowing how proteases recognise preferred substrates facilitates matching proteases to applications. The S1′ pocket of protease EA1 directs cleavage to the N‐terminal side of hydrophobic residues, particularly leucine. The S1′ pocket of thermolysin differs from EA's at only one position (leucine in place of phenylalanine), which decreases cleavage ...
Grant R. Broomfield +3 more
wiley +1 more source
Degree sequences of multigraphs
Let a, b and n be integers, n ≥ 1 and b ≥ a ≥ 0. Let an (a, b, n)-graph defined as a loopless graph G(a, b, n) on n vertices {V1,...,Vn}, in which Vi and Vj are connected with at least a and at most b (directed or undirected) edges. If G(a, b, n) is directed, then it is called (a, b, n)-digraph and if it is undirected, then it is called (a, b, n ...
openaire +2 more sources
Efficient counting of degree sequences [PDF]
Novel dynamic programming algorithms to count the set $D(n)$ of zero-free degree sequences of length $n$, the set $D_c(n)$ of degree sequences of connected graphs on $n$ vertices and the set $D_b(n)$ of degree sequences of biconnected graphs on $n$ vertices exactly are presented.
openaire +3 more sources
Towards random uniform sampling of bipartite graphs with given degree sequence [PDF]
In this paper we consider a simple Markov chain for bipartite graphs with given degree sequence on $n$ vertices. We show that the mixing time of this Markov chain is bounded above by a polynomial in $n$ in case of {\em semi-regular} degree sequence.
Erdös, Péter L. +2 more
core +1 more source
Exploring lipid diversity and minimalism to define membrane requirements for synthetic cells
Designing the lipid membrane of synthetic cells is a complex task, in which its various roles (among them solute transport, membrane protein support, and self‐replication) should all be integrated. In this review, we report the latest top‐down and bottom‐up advances and discuss compatibility and complexity issues of current engineering approaches ...
Sergiy Gan +2 more
wiley +1 more source
Optimization over Degree Sequences [PDF]
We introduce and study the problem of optimizing arbitrary functions over degree sequences of hypergraphs and multihypergraphs. We show that over multihypergraphs the problem can be solved in polynomial time. For hypergraphs, we show that deciding if a given sequence is the degree sequence of a 3-hypergraph is NP-complete, thereby solving a 30 year ...
Shmuel Onn +3 more
openaire +3 more sources
Finding Fullerene Patches in Polynomial Time
We consider the following question, motivated by the enumeration of fullerenes. A fullerene patch is a 2-connected plane graph G in which inner faces have length 5 or 6, non-boundary vertices have degree 3, and boundary vertices have degree 2 or 3.
Bonsma, Paul, Breuer, Felix
core +1 more source
C‐mannosylation is a unique form of protein glycosylation. In this study, we demonstrated that ADAMTS1 is C‐mannosylated at Trp562 and Trp565 in human testicular germ cell tumor NEC8 cells. We found that C‐mannosylation of ADAMTS1 is essential for its secretion, processing, enzymatic activity, and ability to promote vasculogenic mimicry. These findings
Takato Kobayashi +5 more
wiley +1 more source
Weighted hypersoft configuration model
Maximum entropy null models of networks come in different flavors that depend on the type of constraints under which entropy is maximized. If the constraints are on degree sequences or distributions, we are dealing with configuration models.
Ivan Voitalov +4 more
doaj +1 more source
The Arabidopsis mutants hls1 hlh1 and amp1 lamp1 exhibit pleiotropic developmental phenotypes. Although the functions of the causative genes remain unclear, they act in the same genetic pathway and are thought to generate non‐cell‐autonomous signals.
Takashi Nobusawa, Makoto Kusaba
wiley +1 more source

