Results 31 to 40 of about 2,449,773 (154)
Computationally Evidence‐Grounded Sequence‐First Design of Peptide Binders
Advanced Science, EarlyView.BOND‐PEP enables controllable, sequence‐first peptide binder design by grounding generation in binding evidence retrieved for each target. It uses topology‐conditioned message passing to integrate relevant peptide examples with the target protein sequence, forming a residue‐level representation that guides the generation of diverse, target‐specific ...
Wenze Ding
wiley +1 more source
γ-Inverse graph of some mixed graphs
Special MatricesLet GG be a graph. Then, the inverse graph G−1{G}^{-1} of GG is defined to be a graph that has adjacency matrix similar to the inverse of the adjacency matrix of GG, where the similarity matrix is ±1\pm 1 diagonal matrix. In this article, we introduced a
Boulahmar Wafa +2 more
doaj +1 more source
Diagonal Forms, Linear Algebraic Methods and Ramsey-Type Problems [PDF]
, 2013 This thesis focuses mainly on linear algebraic aspects of combinatorics. Let N_t(H) be an incidence matrix with edges versus all subhypergraphs of a complete hypergraph that are isomorphic to H. Richard M.
Wong, Wing Hong Tony
core +1 more source
Advanced Science, EarlyView.The transcription factor MoSR governs DMI fungicide sensitivity in Magnaporthe oryzae through dual regulation of ergosterol biosynthesis and the detoxification enzyme MoDde1. Targeting MoDde1 via a small‐molecule inhibitor or host‐induced gene silencing enhances DMI efficacy against rice blast, offering a sustainable disease management strategy ...
Fan‐Zhu Meng +10 more
wiley +1 more source
Decomposing dense bipartite graphs into 4-cycles [PDF]
, 2015 Let G be an even bipartite graph with partite sets X and Y such that |Y | is even and the minimum degree of a vertex in Y is at least 95|X|/96. Suppose furthermore that the number of edges in G is divisible by 4.
Nicholas J. Cavenagh +1 more
core
Non-bipartite graphs of small Mahler measure [PDF]
, 2013 We classify all non-bipartite graphs that have Mahler measurebelow12(1 +√5). (The bipartite case was covered in an earlier paper by thesecond and third authors.
McKee, James, Smyth, Christopher
core
Business Strategy and the Environment, EarlyView.ABSTRACT This study systematizes the literature on eco‐innovation and economic complexity, aiming to understand how the sophistication of productive structures shapes countries' capacity to develop environmentally responsible innovations, and how eco‐innovation may, in turn, influence productive sophistication.
Gregory Matheus Pereira de Moraes +1 more
wiley +1 more source
The 1 3 $\frac{1}{3}$‐Conjectures for Domination in Cubic Graphs
Journal of Graph Theory, EarlyView.ABSTRACT A set S $S$ of vertices in a graph G $G$ is a dominating set of G $G$ if every vertex not in S $S$ is adjacent to a vertex in S $S$. The domination number of G $G$, denoted by γ ( G ) $\gamma (G)$, is the minimum cardinality among all dominating sets in G $G$. In a breakthrough paper in 2008, Löwenstein and Rautenbach proved that if G $G$ is a
Paul Dorbec, Michael A. Henning
wiley +1 more source
Interval Edge Coloring of Bipartite Graphs with Small Vertex Degrees [PDF]
, 2021 An edge coloring of a graph G is called interval edge coloring if for each v ∈ V(G) the set of colors on edges incident to v forms an interval of integers. A graph G is interval colorable if there is an interval coloring of G.
Małafiejski, Michał +3 more
core +1 more source
Journal of the Science of Food and Agriculture, EarlyView.Abstract BACKGROUND Intercropping of legumes with cereals enhances resilience, resource efficiency, and nutritional quality in food systems, yet few studies have integrated yield stability with grain quantity and post‐harvest processability. Lentils (Lens culinaris Medik.) and hull‐less barley (Hordeum vulgare L. var.
Filippo Carmenati +6 more
wiley +1 more source