Results 71 to 80 of about 970,162 (283)

FGFR Like1 drives esophageal cancer progression via EMT, PI3K/Akt, and notch signalling: insights from clinical data and next‐generation sequencing analysis

open access: yesFEBS Open Bio, EarlyView.
Clinical analysis reveals significant dysregulation of FGFRL1 in esophageal cancer (EC) patients. RNAi‐coupled next‐generation sequencing (NGS) and in vitro study reveal FGFRL1‐mediated EC progression via EMT, PI3K/Akt, and Notch pathways. Functional assays confirm its role in tumor growth, migration, and invasion.
Aprajita Srivastava   +3 more
wiley   +1 more source

Interior point methods 25 years later [PDF]

open access: yesEuropean Journal of Operational Research, 2012
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

Enzymatic degradation of biopolymers in amorphous and molten states: mechanisms and applications

open access: yesFEBS Open Bio, EarlyView.
This review explains how polymer morphology and thermal state shape enzymatic degradation pathways, comparing amorphous and molten biopolymer structures. By integrating structure–reactivity principles with insights from thermodynamics and enzyme engineering, it highlights mechanisms that enable efficient polymer breakdown.
Anđela Pustak, Aleksandra Maršavelski
wiley   +1 more source

A new perspective on the complexity of interior point methods for linear programming [PDF]

open access: yes, 2007
In a dynamical systems paradigm, many optimization algorithms are equivalent to applying forward Euler method to the system of ordinary differential equations defined by the vector field of the search directions.
Cartis, Coralia, Hauser, Raphael
core  

Nuclear pore links Fob1‐dependent rDNA damage relocation to lifespan control

open access: yesFEBS Open Bio, EarlyView.
Damaged rDNA accumulates at a specific perinuclear interface that couples nucleolar escape with nuclear envelope association. Nuclear pores at this site help inhibit Fob1‐induced rDNA instability. This spatial organization of damage handling supports a functional link between nuclear architecture, rDNA stability, and replicative lifespan in yeast.
Yamato Okada   +5 more
wiley   +1 more source

Experimental investigations in combining primal dual interior point method and simplex based LP solvers [PDF]

open access: yes, 1993
The use of a primal dual interior point method (PD) based optimizer as a robust linear programming (LP) solver is now well established. Instead of replacing the sparse simplex algorithm (SSX), the PD is increasingly seen as complementing it. The progress
Levkovitz, R, Mitra, G, Tamiz, M
core  

Polynomial Linear Programming with Gaussian Belief Propagation

open access: yes, 2008
Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typically solves LP problems in time O(n^{3.5}), where $n$ is the number of unknown ...
Bickson, Danny   +3 more
core   +2 more sources

Cutaneous Melanoma Drives Metabolic Changes in the Aged Bone Marrow Immune Microenvironment

open access: yesAging and Cancer, EarlyView.
Melanoma, the deadliest form of skin cancer, increasingly affects older adults. Our study reveals that melanoma induces changes in iron and lipid levels in the bone marrow, impacting immune cell populations and increasing susceptibility to ferroptosis.
Alexis E. Carey   +12 more
wiley   +1 more source

Kernel-Based Interior-Point Methods for Cartesian P*(k)-Linear Complementarity Problems over Symmetric Cones

open access: yesCroatian Operational Research Review, 2011
We present an interior point method for Cartesian P*(k)-Linear Complementarity Problems over Symmetric Cones (SCLCPs). The Cartesian P*(k)-SCLCPs have been recently introduced as the generalization of the more commonly known and more widely used monotone
Goran Lešaja
doaj  

Finding a point in the relative interior of a polyhedron [PDF]

open access: yes, 2007
A new initialization or `Phase I' strategy for feasible interior point methods for linear programming is proposed that computes a point on the primal-dual central path associated with the linear program. Provided there exist primal-dual strictly feasible
Cartis, Coralia, Gould, Nicholas I. M.
core   +1 more source

Home - About - Disclaimer - Privacy