Results 81 to 90 of about 140,549 (266)

Natural Variation of NAR5 Determines Nitrogenase Activity and the Yield in Soybean

open access: yesAdvanced Science, EarlyView.
This study identified NAR5, a gene encoding a subtilisin‐like protease, that regulates nitrogenase activity in soybean nodules. Overexpressing NAR5 delayed nodule senescence, enhancing nitrogenase activity, yield, and low‐nitrogen tolerance. The elite haplotype NAR5HapI‐1 linked to superior nitrogenase activity and greater seed weight has been ...
Chao Ma   +11 more
wiley   +1 more source

Machine‐Learning Microfluidic Minute‐Scale Microorganism Metrics Monitoring(M6)

open access: yesAdvanced Science, EarlyView.
ABSTRACT On‐site monitoring of microorganisms remains challenging because of low concentrations, strong background interference, and dynamic aerosol diffusion, particularly for aerosol‐transmitted pathogens. Here, we report a rapid detection platform that integrates a Puri‐focusing microfluidic chip, electrochemical impedance spectroscopy (EIS), and ...
Ning Yang   +14 more
wiley   +1 more source

A quantitative geospatial analysis of the risk that Boko Haram will target a school.

open access: yesPLoS ONE
We provide a novel quantitative geospatial analysis of school attacks perpetrated by Boko Haram in Nigeria. Such attacks are used by Boko Haram to kidnap boys (for potential use as child soldiers and suicide bombers) and girls (for potential use as ...
Lirika Sola   +2 more
doaj   +1 more source

Graph Theoretical Analysis Reveals: Women's Brains Are Better Connected than Men's.

open access: yesPLoS ONE, 2015
Deep graph-theoretic ideas in the context with the graph of the World Wide Web led to the definition of Google's PageRank and the subsequent rise of the most popular search engine to date. Brain graphs, or connectomes, are being widely explored today. We
Balázs Szalkai   +2 more
doaj   +1 more source

Spanners for Geometric Intersection Graphs

open access: yes, 2006
Efficient algorithms are presented for constructing spanners in geometric intersection graphs. For a unit ball graph in R^k, a (1+\epsilon)-spanner is obtained using efficient partitioning of the space into hypercubes and solving bichromatic closest pair
Furer, Martin   +1 more
core   +2 more sources

Five edge-independent spanning trees

open access: yesProcedia Computer Science, 2023
Alonso Ali, Orlando Lee
openaire   +1 more source

Leveraging Artificial Intelligence and Large Language Models for Cancer Immunotherapy

open access: yesAdvanced Science, EarlyView.
Cancer immunotherapy faces challenges in predicting treatment responses and understanding resistance mechanisms. Artificial intelligence (AI) and machine learning (ML) offer powerful solutions for cancer immunotherapy in patient stratification, biomarker discovery, treatment strategy optimization, and foundation model development.
Xinchao Wu   +4 more
wiley   +1 more source

Exploration of schizophrenia-associated gene modules using graph theory, co-expression networks, and dimensionality reduction.

open access: yesPLoS ONE
The PsychENCODE consortium has generated a comprehensive multi-omic dataset from human brain samples, spanning healthy individuals and those with neuropsychiatric disorders.
Costas Bampos, Vasileios Megalooikonomou
doaj   +1 more source

Computational results for Constrained Minimum Spanning Trees in Flow Networks [PDF]

open access: yes
In this work, we address the problem of finding a minimum cost spanning tree on a single source flow network. The tree must span all vertices in the given network and satisfy customer demands at a minimum cost. The total cost is given by the summation of
Dalila B. M. M. Fontes
core  

Mimimal graphs for completely independent spanning trees and completely independent spanning trees in complete t-partite graph

open access: yesContributions to Discrete Mathematics
Let $T_{1},T_{2},\dots,T_{k}$ be spanning trees of a graph $G$. For any two vertices$u,v$ of $G$, if the paths from $u$ to $v$ in these $k$ trees are pairwise openly disjoint, then we say that $T_{1},T_{2},\dots,T_{k}$ are completely independent spanning trees.
Xia Hong 0005, Feng Gao, Zengbao Wu
openaire   +2 more sources

Home - About - Disclaimer - Privacy