Results 111 to 120 of about 20,650,729 (303)
Graph Pattern Matching: From Intractable to Polynomial Time [PDF]
, 2010 Graph pattern matching is typically defined in terms of sub-graph isomorphism, which makes it an np-complete problem. Moreover, it requires bijective functions, which are often too restrictive to characterize patterns in emerging applications. We propose
Li, Jianzhong +5 more
core
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
Dominating induced matchings and other graph parameters
AKCE International Journal of Graphs and CombinatoricsA matching M in a graph G is an induced matching if the largest degree of the subgraph of G induced by M is equal to one. A dominating induced matching (DIM) of G is an induced matching that dominates every edge of G. It is well known that, if they exist,
A. Mahmoodi +3 more
doaj +1 more source
Conserved binding mode but diverse interfaces of MreC‐PBP2 interactions
FEBS Letters, EarlyView.The crystal structure of abMreC reveals a conserved two β‐barrel architecture and provides structural insights into its role within the bacterial elongasome. The abMreC–abPBP2 complex model identifies the molecular basis of MreC‐mediated PBP2 recognition, contributing to the regulation of peptidoglycan synthesis.
Hyunseok Jang +4 more
wiley +1 more source
Extremal hypergraphs for matching number and domination number
Discrete Applied Mathematics, 2018 A matching in a hypergraph $\mathcal{H}$ is a set of pairwise disjoint hyperedges. The matching number $ν(\mathcal{H})$ of $\mathcal{H}$ is the size of a maximum matching in $\mathcal{H}$. A subset $D$ of vertices of $\mathcal{H}$ is a dominating set of $\mathcal{H}$ if for every $v\in V\setminus D$ there exists $u\in D$ such that $u$ and $v$ lie in an
Erfang Shan +3 more
openaire +3 more sources
Matching with Trade-offs: Revealed Preferences over Competiting Characteristics [PDF]
We investigate in this paper the theory and econometrics of optimal matchings with competing criteria. The surplus from a marriage match, for instance, may depend both on the incomes and on the educations of the partners, as well as on characteristics ...
Alfred Galichon, Bernard Salanié
core
Microbiome‐blood–brain barrier interactions in aging — mechanisms and therapeutic potential
FEBS Letters, EarlyView.Aging reshapes the gut microbiome (↓SCFA‐producing commensals; ↑pro‐inflammatory outputs), shifting circulating metabolites (↓SCFAs; ↑LPS, ↑TMAO, ↑PAA) that act at the BBB to increase nonspecific transcytosis, alter transport, and promote astrocyte reactivity, heightening brain vulnerability.
Daniel Cuervo‐Zanatta +3 more
wiley +1 more source
Multivariate and Propensity Score Matching Software with Automated Balance Optimization: The Matching package for R [PDF]
Matching is an R package which provides functions for multivariate and propensity score matching and for finding optimal covariate balance based on a genetic search algorithm.
Jasjeet S. Sekhon
core
An epithelial GPR35 isoform supports tumor‐associated transcriptional and metabolic phenotypes
FEBS Letters, EarlyView.GPR35 generates two functionally distinct isoforms with previously unresolved roles. GPR35‐short mediates immune‐cell chemotaxis, while GPR35‐long is enriched in colorectal cancer epithelium, where it supports increased metabolism, proliferation, and tumor‐associated transcriptional programs.
Jørgen D. Rønneberg +14 more
wiley +1 more source
Complete solution for the rainbow numbers of matchings
Discrete Mathematics, 2009 20 ...
He Chen 0002 +2 more
openaire +4 more sources