Results 231 to 240 of about 942,960 (263)

OrgaCCC: Orthogonal graph autoencoders for constructing cell-cell communication networks on spatial transcriptomics data. [PDF]

PLoS Comput Biol
Feng X, Zhang S, Li L.
europepmc   +1 more source

GeminiOne transcatheter edge-to-edge repair: comparative hemodynamic and biomechanical evaluation. [PDF]

Front Cardiovasc Med
Wang K, Xu D, Xiao B, He Z, Tan J, Kar S.   +5 more
europepmc   +1 more source

Ribosome biogenesis-related gene signature predicts prognosis and immune landscape in glioma and identifies UTP20 as a therapeutic target. [PDF]

Front Immunol
Li Y, Tang X, Zhao W, Si X, Cui Y, Dong Y, Liu Y.   +6 more
europepmc   +1 more source

Phosphoglycerate Dehydrogenase Overexpression Inhibits Ferroptosis to Repress Calcification of Human Coronary Artery Vascular Smooth Muscle Cells via the P53/SLC7A11 Pathway. [PDF]

Int J Gen Med
Zou Y, Li D, Guan G, Liu W.
europepmc   +1 more source

Protective effects of insulin on dry eye syndrome via TLR4/NF-κB pathway: based on network pharmacology and in vitro experiments validation. [PDF]

Front Pharmacol
Yuan X, Zhang Y, Wang S, Du Z.
europepmc   +1 more source

Global research progress and trends in traditional Chinese medicine for chronic kidney disease since the 21st century: a bibliometric analysis. [PDF]

Front Med (Lausanne)
Wang H, Wang J, Chen Y, Yang D, Xiong L.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Rotation Averaging with the Chordal Distance: Global Minimizers and Strong Duality

IEEE Transactions on Pattern Analysis and Machine Intelligence, 2021
In this paper we explore the role of duality principles within the problem of rotation averaging, a fundamental task in a wide range of applications.
Anders P. Eriksson, Carl Olsson, Fredrik Kahl, Tat-Jun Chin   +3 more
semanticscholar   +1 more source

Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable

International Workshop on Graph-Theoretic Concepts in Computer Science, 2021
The computational complexity of the graph isomorphism problem is considered to be a major open problem in theoretical computer science. It is known that testing isomorphism of chordal graphs is polynomial-time equivalent to the general graph isomorphism ...
V. Arvind, R. Nedela, I. Ponomarenko, Peter Zeman   +3 more
semanticscholar   +1 more source