Results 141 to 150 of about 10,299 (219)

DNA Methylation Shapes Seed‐Borne Microbiome and Proteome Responses During Early Maize‐Beneficial Bacteria Interactions

Plant, Cell &Environment, EarlyView.
ABSTRACT Microorganism and plant interactions are crucial for development and environmental adaptation. Plant growth promoting bacteria enhance agricultural productivity in a sustainable manner, while epigenetic modifications such as DNA methylation regulate gene expression and adaptive responses.
Pedro Igor Zocateli, Geovanna Vitória Olímpio, Felipe Astolpho de Almeida, Letícia Oliveira da Rocha, Diego Vinicius de Sena Martins, Sara Sangi, Fábio Lopes Olivares, Elyabe Monteiro de Matos, Juliana Siqueira, Lyderson Facio Viccini, Roberta Pena da Paschoa, Vanildo Silveira, Clícia Grativol   +12 more
wiley   +1 more source

The maximum number of edges of bipartite 1-planar graphs with 1-disk drawings

AKCE International Journal of Graphs and Combinatorics
A graph is 1-planar if it admits a drawing in the plane such that each edge is crossed at most once. Let G be a bipartite 1-planar graph with bipartition sets X and Y. A 1-disk [Formula: see text] drawing of G is a 1-planar drawing such that all vertices
Guiping Wang
doaj   +1 more source

scMOG: A graph neural network method for regulatory relationship‐preserving single‐cell multi‐omics integration

Quantitative Biology, Volume 14, Issue 3, September 2026.
Abstract Single‐cell multi‐omics sequencing technology provides a powerful tool for studying cellular heterogeneity. However, beyond the challenges of sparsity, heterogeneity, and dimensionality differences, a critical challenge in multi‐omics data integration lies in preserving the true regulatory relationships among molecular features.
Yucheng Lu, Xun Zhang, Hongwei Li
wiley   +1 more source

Genome–phenome association prediction using weighted deep matrix factorization with a multisource graph attention network

Quantitative Biology, Volume 14, Issue 3, September 2026.
Abstract Genome–phenome association (GPA) prediction can broaden the understanding of biological mechanisms underlying complex phenotypic traits (e.g., diseases and agronomic traits). Traditional deep matrix factorization (DMF)‐based GPA methods can integrate multiple data types and uncover nonlinear associations but often rely on low‐dimensional ...
Ran Duan, Wei Cao, Maozu Guo, Le Tian, Lingling Zhao   +4 more
wiley   +1 more source

Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant

Journal of Combinatorial Designs, Volume 34, Issue 8, Page 361-377, August 2026.
ABSTRACT The Oberwolfach problem OP ( F ), for a 2‐factor F of K n, asks whether there exists a 2‐factorization of K n (if n is odd) or K n − I (if n is even) where each 2‐factor is isomorphic to F. Here, I denotes any 1‐factor of K n. For even n, the problem OP ( F ) may also be denoted OP − ( F ), and has been nicknamed the spouse‐avoiding variant ...
Maruša Lekše, Mateja Šajna
wiley   +1 more source

Tight Bounds for Hypercube Minor‐Universality

Journal of Graph Theory, Volume 112, Issue 4, Page 433-437, August 2026.
ABSTRACT A graph G is m‐minor‐universal if every graph H with at most m edges and no isolated vertices is contained as a minor in G. Recently, Benjamini, Kalifa and Tzalik proved that there is an absolute constant c > 0 such that the d‐dimensional hypercube Q d is ( c ⋅ 2 d / d)‐minor‐universal, while there is an absolute constant K > 0 such that Q d ...
Emma Hogan, Lukas Michel, Alex Scott, Youri Tamitegama, Jane Tan, Dmitry Tsarev   +5 more
wiley   +1 more source

Long Induced Paths in K s , s‐Free Graphs

Journal of Graph Theory, Volume 112, Issue 4, Page 438-441, August 2026.
ABSTRACT More than 40 years ago, Galvin, Rival, and Sands showed that every K s , s‐free graph containing an n‐vertex path must contain an induced path of length f ( n ), where f ( n ) → ∞ as n → ∞. Recently, it was shown by Duron, Esperet, and Raymond that one can take f ( n ) = ( log log n ) 1 / 5 − o ( 1 ).
Zach Hunter, Aleksa Milojević, Benny Sudakov, István Tomon   +3 more
wiley   +1 more source

Bipartite friends and strangers walking on bipartite graphs

Discrete Mathematics
18 pages, 8 figures, 2 ...
openaire   +3 more sources

Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces

Journal of Graph Theory, Volume 112, Issue 4, Page 491-506, August 2026.
ABSTRACT The concept of graph embeddability, initially formalized by Belk and Connelly and later expanded by Sitharam and Willoughby, extends the question of embedding finite metric spaces into a given normed space. A finite simple graph G = ( V , E ) is said to be ( X , Y )‐embeddable if any set of induced edge lengths from an embedding of G into a ...
Sean Dewar, Eleftherios Kastis, Derek Kitson, William Sims   +3 more
wiley   +1 more source

Toward heterogeneous information fusion: bipartite graph convolutional networks for in silico drug repurposing. [PDF]

Bioinformatics, 2020
Wang Z, Zhou M, Arnold C.
europepmc   +1 more source