Results 81 to 90 of about 1,265 (189)
The cylindrical local crossing number of the complete bipartite graph
A bipartite-cylindrical drawing of the complete bipartite graph Km,n is a drawing on the surface of a cylinder, where the vertices are placed on the boundaries of the cylinder, one vertex-partition per boundary, and the edges do not cross the boundaries.
Khachatryan, Nushik
core
ABSTRACT Plant viruses are recognized as rapid and effective vectors to deliver CRISPR‐Cas reaction components into plants, a strategy termed virus‐induced gene editing (VIGE). However, VIGE is limited by the host range of the viral vectors. Development of new viral vectors to target a broad range of plant species will potentially enable the delivery ...
Fernando Merwaiss +3 more
wiley +1 more source
Natural Variation in GmSL20 Improves Seed Size and Quality in Soybean
ABSTRACT Seed size plays an important role in determining crop yield, yet the genetic mechanisms underlying the regulation of this agronomic trait remain incompletely understood in soybean. Here, we perform a genome‐wide association study mapping with seed length variations and identify a major quantitative trait locus (QTL) on chromosome 20, named ...
Yuechuan Luo +12 more
wiley +1 more source
A representation of a set of maps as a ribbon bipartite graph
In this purely experimental work we try to represent the set of plane maps with 3 vertices and 3 faces as a bipartite ribbon graph. In particular, this construction allows one to estimate the genus of the initial set.Comment: 5 pages, 9 figures, 4 ...
Kochetkov, Yury
core
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 +12 more
wiley +1 more source
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
The minimum size of maximal bipartite IC-plane graphs with given connectivity
Recently, the problem of establishing bounds on the edge density of 1-planar graphs, including their subclass IC-planar graphs, has received considerable attention. In 2018, Angelini et al. showed that any n-vertex bipartite IC-planar graph has at most 2.25n-4 edges, which implies that bipartite IC-planar graphs have vertex-connectivity at most 4.
Guiping Wang +3 more
openaire +2 more sources
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 +4 more
wiley +1 more source
Tight Bounds for Hypercube Minor‐Universality
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 +5 more
wiley +1 more source
Edge‐Length Preserving Embeddings of Graphs Between Normed Spaces
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 +3 more
wiley +1 more source

