Results 271 to 280 of about 4,029,048 (318)
This paper reveals how human lactoferrin–albumin fusion (hLF‐HSA) potently suppresses lung adenocarcinoma cell migration. hLF‐HSA upregulates NHE7, leading to Golgi alkalization, disruption of the Golgi secretome, downregulation of MMP1, and reversal of EMT. These findings suggest a novel Golgi‐targeting strategy to suppress cancer cell migration.
Hana Nopia +3 more
wiley +1 more source
Safety and Efficacy of a 24-Cycle Administration of a Drospirenone-Only Pill in Japanese Women. [PDF]
Kitamura K +5 more
europepmc +1 more source
Chemotherapy side effects significantly impact cancer survivors' quality of life. Using protein levels in blood samples from breast cancer patients before and after 12 weeks of taxane treatment, we detected treatment‐dependent changes in calcium signaling and aging pathways associated with cancer recurrence.
Saira Munshani +6 more
wiley +1 more source
Retraction: Golgi integral membrane protein 4 manipulates cellular proliferation, apoptosis and cell cycle in human head and neck cancer. [PDF]
Cui X +5 more
europepmc +1 more source
The MRP4 transporter exports several drugs and signaling molecules. Here, we identified key promoter elements regulating basal MRP4 expression. Using reporter assays, we defined a conserved region with essential Sp1 and contributory Ets sites, which controlled basal MRP4 expression.
Debora Singer +7 more
wiley +1 more source
Accumulated Plastic Deformation Monitoring of Cement Sheath Interface Using Fiber-Optic Bragg Gratings. [PDF]
Cheng Y +5 more
europepmc +1 more source
Protocol for cell cycle-resolved high-content imaging of transcription condensate dynamics in human cells. [PDF]
Russo MR, McEvoy MJ, Saldivar JC.
europepmc +1 more source
Determinants of patient cycle time in primary healthcare: a large-scale retrospective study from Saudi Arabia. [PDF]
Al Shammari MA, Boubshait LA.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
2005
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/or length of the covering cycles. In particular, we give a (1+ln 2)-approximation for the lane covering problem [3,4] in weighted graphs with metric lengths on the edges and an
Nicole Immorlica +2 more
openaire +1 more source
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/or length of the covering cycles. In particular, we give a (1+ln 2)-approximation for the lane covering problem [3,4] in weighted graphs with metric lengths on the edges and an
Nicole Immorlica +2 more
openaire +1 more source
Order, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter C. Fishburn, Douglas R. Woodall
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter C. Fishburn, Douglas R. Woodall
openaire +2 more sources

