Results 11 to 20 of about 3,103 (144)

Comprehensive transcriptomic analysis of two RIL parents with contrasting salt responsiveness identifies polyadenylated and non-polyadenylated flower lncRNAs in chickpea. [PDF]

Plant Biotechnol J, 2022
Summary Salinity severely affects the yield of chickpea. Understanding the role of lncRNAs can shed light on chickpea salt tolerance mechanisms. However, because lncRNAs are encoded by multiple sites within the genome, their classification to reveal functional versatility at the transcriptional and the post‐transcriptional levels is challenging.
Kaashyap M, Kaur S, Ford R, Edwards D, Siddique KHM, Varshney RK, Mantri N.   +6 more
europepmc   +2 more sources

The mysterious middlemen making your vision pop: understanding the function of amacrine cells. [PDF]

J Physiol
Abstract figure legend This review aims to illustrate the diversity and function of amacrine cells in the retina. The diversity of amacrine cell subtypes is depicted based on morphology, stratification and neurotransmitter expression, along with their synaptic connectivity with bipolar and ganglion cells, emphasizing inhibitory and modulatory roles ...
Calbiague-Garcia V, Varro D, Buffet T, Marre O.   +3 more
europepmc   +2 more sources

Accumulation of network redundancy marks the early stage of Alzheimer's disease

Human Brain Mapping, Volume 44, Issue 8, Page 2993-3006, June 1, 2023., 2023
We demonstrated the utility of our redundancy metric in differentiating the stages of AD progression. We reported a pattern of accrual of redundant connections in MCI to counter AD pathology. Our results provide evidence supporting redundancy as a neuroprotective mechanism in cognitive aging.
Maryam Ghanbari, Guoshi Li, Li‐Ming Hsu, Pew‐Thian Yap   +3 more
wiley   +1 more source

Turán‐type problems for long cycles in random and pseudo‐random graphs

Journal of the London Mathematical Society, Volume 107, Issue 4, Page 1519-1551, April 2023., 2023
Abstract We study the Turán number of long cycles in random and pseudo‐random graphs. Denote by ex(G(n,p),H)$\operatorname{ex}(G(n,p),H)$ the random variable counting the number of edges in a largest subgraph of G(n,p)$G(n,p)$ without a copy of H$H$. We determine the asymptotic value of ex(G(n,p),Ct)$\operatorname{ex}(G(n,p), C_t)$, where Ct$C_t$ is a ...
Michael Krivelevich, Gal Kronenberg, Adva Mond   +2 more
wiley   +1 more source

Spanning eulerian subdigraphs in semicomplete digraphs

Journal of Graph Theory, Volume 102, Issue 3, Page 578-606, March 2023., 2023
Abstract A digraph is eulerian if it is connected and every vertex has its in‐degree equal to its out‐degree. Having a spanning eulerian subdigraph is thus a weakening of having a hamiltonian cycle. In this paper, we first characterize the pairs (D,a) $(D,a)$ of a semicomplete digraph D $D$ and an arc a $a$ such that D $D$ has a spanning eulerian ...
Jørgen Bang‐Jensen, Frédéric Havet, Anders Yeo   +2 more
wiley   +1 more source

Uniformly connected graphs

Journal of Graph Theory, Volume 101, Issue 2, Page 210-225, October 2022., 2022
Abstract In this article, we investigate the structure of uniformly k $k$‐connected and uniformly k $k$‐edge‐connected graphs. Whereas both types have previously been studied independent of each other, we analyze relations between these two classes. We prove that any uniformly k $k$‐connected graph is also uniformly k $k$‐edge‐connected for k≤3 $k\le 3$
Frank Göring, Tobias Hofmann, Manuel Streicher   +2 more
wiley   +1 more source

Effect of Fragmentation on Pore Structures and Fractal Characteristics of Intact Coal and Deformed Coal Based on Experiments

Geofluids, Volume 2022, Issue 1, 2022., 2022
Coal mining has to develop to deeper strata with the increasing demand for coal, which leads to frequent coal and gas outburst disasters. Especially, when there is a deformed coal in the coal seam, the outburst disasters are easier and more intense. Coal and gas outburst disasters can be promoted by the fragmentation.
Mingjie Li, Shouqing Lu, Chengfeng Wang, Jie Liu, Jiang Shi, Taibiao Bei, Su Shan-Jie   +6 more
wiley   +1 more source

On the infinite Lucchesi–Younger conjecture I

Journal of Graph Theory, Volume 98, Issue 1, Page 27-48, September 2021., 2021
Abstract A dicut in a directed graph is a cut for which all of its edges are directed to a common side of the cut. A famous theorem of Lucchesi and Younger states that in every finite digraph the least size of an edge set meeting every dicut equals the maximum number of disjoint dicuts in that digraph. In this first paper out of a series of two papers,
J. Pascal Gollin, Karl Heuer
wiley   +1 more source

Greedoids from flames

Journal of Graph Theory, Volume 98, Issue 1, Page 49-56, September 2021., 2021
Abstract A digraph D with r ∈ V ( D ) is an r‐flame if for every v ∈ V ( D ) − r, the in‐degree of v is equal to the local edge‐connectivity λ D ( r , v ). We show that for every digraph D and r ∈ V ( D ), the edge sets of the r‐flame subgraphs of D form a greedoid.
Attila Joó
wiley   +1 more source

Microstructure Analysis on the Fracture Network in High‐Rank Coals

Earth and Space Science, Volume 8, Issue 8, August 2021., 2021
Abstract Microfractures in the coal matrix have complex spatial structure because of the joint effects of coalification and tectonism. The accurate modeling and characterization of microfractures directly affect mechanism analysis of coal rock fracturing and mining.
Shuaifeng Lyu, Xiaojun Chen, Rui Li, Shengwei Wang, Jie Liu, Penglei Shen   +5 more
wiley   +1 more source