Results 101 to 110 of about 49,235 (305)

Solving Medium to Large Sized Euclidean Generalized Minimum Spanning Tree Problems [PDF]

open access: yes
The generalized minimum spanning tree problem is a generalization of the minimum spanning tree problem. This network design problems finds several practical applications, especially when one considers the design of a large-capacity backbone network ...
Ghosh, Diptesh
core  

3D Chromatin Architecture Provides Insights Into Leaf Trait Variation Among Pear Species

open access: yesAdvanced Science, EarlyView.
ABSTRACT Three‐dimensional (3D) chromatin architecture plays a fundamental role in eukaryotic gene regulations, its functional significance in perennial fruit trees remains poorly characterized despite extensive applications in crop genomics. Here, we developed high‐resolution (∼5 kb) Hi‐C maps of Pyrus and compared 3D genomic architecture of three ...
Yueyuan Liu   +11 more
wiley   +1 more source

Efficient phase unwrapping [PDF]

open access: yes, 2005
In the field of optical interferometry, two-dimensional projections of light interference patterns are often analysed in order to obtain measurements of interest.
AI-Sawaf, Firas
core  

Maximizing the number of spanning trees in a graph with n nodes and m edges

open access: yes, 1974
The problem considered is that of determining, among all graphs on n nodes and m edges, those having the maximum number of spanning trees. The possible candidate graphs can be obtained by deleting some number k of edges from a complete n-node graph.
Shier, D. R.
core   +1 more source

ETEA: A euclidean minimum spanning tree-Based evolutionary algorithm for multiobjective optimization [PDF]

open access: yes, 2013
© the Massachusetts Institute of TechnologyAbstract The Euclidean minimum spanning tree (EMST), widely used in a variety of domains, is a minimum spanning tree of a set of points in the space, where the edge weight between each pair of points is their ...
Yang, S   +8 more
core   +1 more source

Integration of Spatiotemporal Multi‐Omics in Peach Fruit Unravels a Metabolic Niche and the Genetic Basis of Trichome‐Mediated Stress Adaptation

open access: yesAdvanced Science, EarlyView.
This study constructed the first spatiotemporal multi‐omics map of peach fruit and discovered a key candidate gene that synergistically regulates trichome development and drought tolerance through the jasmonic acid signaling pathway, providing insights into the coupling mechanism between development and stress resistance.
Zhixin Liu   +9 more
wiley   +1 more source

An Ever Closer Union? Examining The Evolution Of The Integration Of European Equity Markets Via Minimum Spanning Trees [PDF]

open access: yes
The concept of a minimum spanning tree (MST) is used to study the process of comovements for 21 European Union stock market indices. We show how the asset tree and its related hierarchical tree evolve over time and describe the dynamics.
Marian Boscia   +2 more
core  

Expanders via Random Spanning Trees

open access: yes, 2018
Motivated by the problem of routing reliably and scalably in a graph, we introduce the notion of a splicer, the union of a small number of spanning trees of a graph.
Santosh Vempala (5363981)   +3 more
core   +1 more source

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

A Probabilistic Tabu Search Algorithm for the Generalized Minimum Spanning Tree Problem [PDF]

open access: yes
In this paper we present a probabilistic tabu search algorithm for the generalized minimum spanning tree problem. The basic idea behind the algorithm is to use preprocessing operations to arrive at a probability value for each vertex which roughly ...
Ghosh, Diptesh
core  

Home - About - Disclaimer - Privacy