Results 101 to 110 of about 3,067,250 (321)
Wir betrachten zwei Probleme der algorithmischen Graphentheorie und Netzwerkanalyse. Beim "Dag Realisationsproblem" sei eine endliche Sequenz S von Paaren natürlicher Zahlen gegeben. Gibt es einen Dag (ohne parallele Kanten und Schleifen) der S als Knotengradsequenz besitzt?
openaire +2 more sources
Multidrug transporters BpeB and BpeF from the Gram‐negative pathogen Burkholderia pseudomallei have a hydrophilic patch in their substrate‐binding pocket. Drug susceptibility tests and growth curve analyses using an Escherichia coli recombinant expression system revealed that the hydrophilic patches of BpeB and BpeF are involved in the substrate ...
Ui Okada, Satoshi Murakami
wiley +1 more source
Comparing alternatives to the fixed degree sequence model for extracting the backbone of bipartite projections. [PDF]
Neal ZP, Domagalski R, Sagan B.
europepmc +1 more source
Function‐driven design of a surrogate interleukin‐2 receptor ligand
Interleukin (IL)‐2 signaling can be achieved and precisely fine‐tuned through the affinity, distance, and orientation of the heterodimeric receptors with their ligands. We designed a biased IL‐2 surrogate ligand that selectively promotes effector T and natural killer cell activation and differentiation. Interleukin (IL) receptors play a pivotal role in
Ziwei Tang +9 more
wiley +1 more source
Degree-based connected graph construction with assortativity constraint
Degree-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
Mechanisms of parasite‐mediated disruption of brain vessels
Parasites can affect the blood vessels of the brain, often causing serious neurological problems. This review explains how different parasites interact with and disrupt these vessels, what this means for brain health, and why these processes matter. Understanding these mechanisms may help us develop better ways to prevent or treat brain infections in ...
Leonor Loira +3 more
wiley +1 more source
On relationship between reformulated Sombor and other vertex--degree indices [PDF]
Let $G=(V,E)$, $V=\{v_1, v_2,\ldots,v_n\}$, $E=\{e_1, e_2,\ldots,e_m\}$, be a simple connected graph with $n\ge 2$ vertices and $m$ edges, with vertex degree sequence $\Delta=d_1\ge d_2\ge \cdots \ge d_n=\delta$, $ d_i=d(v_i)$, and edge degree sequence $\
Emina Milovanovic +4 more
doaj +1 more source
Approximate realizations for outerplanaric degree sequences
We study the question of whether a sequence d = (d_1,d_2, \ldots, d_n) of positive integers is the degree sequence of some outerplanar (a.k.a. 1-page book embeddable) graph G. If so, G is an outerplanar realization of d and d is an outerplanaric sequence.
Bar-Noy, Amotz +4 more
openaire +3 more sources
Multiple ETS family transcription factors bind mutant p53 via distinct interaction regions
Mutant p53 gain‐of‐function is thought to be mediated by interaction with other transcription factors. We identify multiple ETS transcription factors that can bind mutant p53 and found that this interaction can be promoted by a PXXPP motif. ETS proteins that strongly bound mutant p53 were upregulated in ovarian cancer compared to ETS proteins that ...
Stephanie A. Metcalf +6 more
wiley +1 more source
Complexity Estimation of Infrared Image Sequence for Automatic Target Track
Infrared image complexity metrics are an important task of automatic target recognition and track performance assessment. Traditional metrics, such as statistical variance and signal-to-noise ratio, targeted to single frame infrared image. However, there
doaj +1 more source

