Results 101 to 110 of about 5,011,430 (289)
The Neighbor Matrix: generalizing the degree sequence [PDF]
, 2015 The newly introduced neighborhood matrix extends the power of adjacency and distance matrices to describe the topology of graphs. The adjacency matrix enumerates which pairs of vertices share an edge and it may be summarized by the degree sequence, a ...
Gera, Ralucca M. +2 more
core +2 more sources
FEBS Letters, EarlyView.CT10 regulator of kinase (CRK) and CRK‐Like (CRKL) are signaling adaptors driving cell adhesion, motility, differentiation, and proliferation. SH2‐domain containing (SH) proteins are enriched in YXXP motifs which when phosphorylated create preferred binding sites for CRK family SH2 domains.
Phoebe M. Cousens +8 more
wiley +1 more source
A Note on Degree Sequences of Graphs [PDF]
Canadian Mathematical Bulletin, 1980 AbstractSufficient conditions for a sequence of numbers to be the degree sequence of a graph are derived from the Erdos-Gallai theorem on degree sequences of graphs.
openaire +2 more sources
Reconstructing enzyme evolution by protein engineering
FEBS Letters, EarlyView.Natural enzyme evolution can be retraced by protein engineering methods such as directed evolution, rational design, and ancestral sequence reconstruction. These approaches reveal how enzymes emerged from ligand‐binding scaffolds, developed varying substrate preferences, formed oligomeric complexes, adapted to environmental changes, and evolved novel ...
Lukas Drexler +2 more
wiley +1 more source
Hamiltonian-connected graphs and their strong closures
International Journal of Mathematics and Mathematical Sciences, 1997 Let G be a simple graph of order at least three. We show that G is Hamiltonian-connected if and only if its strong closure is Hamiltonian-connected. We also give an efficient algorithm to compute the strong closure of G.
Pak-Ken Wong
doaj +1 more source
Comparing alternatives to the fixed degree sequence model for extracting the backbone of bipartite projections. [PDF]
Sci Rep, 2021 Neal ZP, Domagalski R, Sagan B.
europepmc +1 more source
Hamiltonian degree sequences in digraphs
Journal of Combinatorial Theory, Series B, 2010 We show that for each η>0 every digraph G of sufficiently large order n is Hamiltonian if its out- and indegree sequences d^+_1\le ... \le d^+_n and d^- _1 \le ... \le d^-_n satisfy (i) d^+_i \geq i+ ηn or d^-_{n-i- ηn} \geq n-i and (ii) d^-_i \geq i+ ηn or d^+_{n-i- ηn} \geq n-i for all i < n/2. This gives an approximate solution to a problem of
Daniela Kühn +2 more
openaire +3 more sources
FEBS Letters, EarlyView.The process of internalization of the Shiga toxin A subunit via formation of a complex with the Shiga toxin B subunit, which specifically binds to the Gb3 receptor. The peptide is designed to act as a carrier of drugs into cancer cells. Here, we explored the potential of peptides derived from the catalytic A subunit of Shiga toxin (STxA) to be drug ...
Giulia Opassi +6 more
wiley +1 more source
Degree-based connected graph construction with assortativity constraint
New Journal of PhysicsDegree-based graph construction is a fundamental problem in network science. A graph is simple if there are no self-loops and no multiple links between any pair of nodes in the graph. A degree sequence $d = (d_1, d_2,\cdots, d_{N})$ is graphical if d can
Yingyue Ke, Piet Van Mieghem
doaj +1 more source
Investigating transcription factor dynamics in health and disease using FRAP
FEBS Letters, EarlyView.FRAP analysis of GFP‐tagged transcription factors reveals how molecular mobility and target engagement change in response to drug treatment. By combining live‐cell imaging, quantitative model fitting, and statistical analysis, this approach uncovers transcription factor dynamics linked to disease mechanisms, providing a powerful framework for ...
Kannan Govindaraj +3 more
wiley +1 more source