Results 81 to 90 of about 211,682 (273)

Exploiting metabolic adaptations to overcome dabrafenib treatment resistance in melanoma cells

open access: yesMolecular Oncology, EarlyView.
We show that dabrafenib‐resistant melanoma cells undergo mitochondrial remodeling, leading to elevated respiration and ROS production balanced by stronger antioxidant defenses. This altered redox state promotes survival despite mitochondrial damage but renders resistant cells highly vulnerable to ROS‐inducing compounds such as PEITC, highlighting redox
Silvia Eller   +17 more
wiley   +1 more source

LDAcoop: Integrating non‐linear population dynamics into the analysis of clonogenic growth in vitro

open access: yesMolecular Oncology, EarlyView.
Limiting dilution assays (LDAs) quantify clonogenic growth by seeding serial dilutions of cells and scoring wells for colony formation. The fraction of negative wells is plotted against cells seeded and analyzed using the non‐linear modeling of LDAcoop.
Nikko Brix   +13 more
wiley   +1 more source

COMBINATORIAL OPTIMIZATION UNDER UNCERTAINTY AND FORMAL MODELS OF EXPERT ESTIMATION

open access: yesВісник Національного технічного університету "ХПÌ": Системний аналіз, управління та інформаційні технології, 2019
Previously, the author formalized the concepts of uncertainty, compromise solution, compromise criteria and conditions for a quite general class of combinatorial optimization problems.
Alexander Anatolievich Pavlov
doaj   +1 more source

An Entropy-Based Approach to Portfolio Optimization

open access: yesEntropy, 2020
This paper presents an improved method of applying entropy as a risk in portfolio optimization. A new family of portfolio optimization problems called the return-entropy portfolio optimization (REPO) is introduced that simplifies the computation of ...
Peter Joseph Mercurio   +2 more
doaj   +1 more source

The matching relaxation for a class of generalized set partitioning problems

open access: yes, 2018
This paper introduces a discrete relaxation for the class of combinatorial optimization problems which can be described by a set partitioning formulation under packing constraints.
Cavalcante, Evellyn   +3 more
core  

Nearly-optimal quantum control: analytical approach

open access: yes, 2017
We propose nearly-optimal control strategies for changing states of a quantum system. We argue that quantum control optimization can be studied analytically within some protocol families that depend on a small set of parameters for optimization.
Saxena, Avadh   +2 more
core   +1 more source

Infrared laser sampling of low volumes combined with shotgun lipidomics reveals lipid markers in palatine tonsil carcinoma

open access: yesMolecular Oncology, EarlyView.
Nanosecond infrared laser (NIRL) low‐volume sampling combined with shotgun lipidomics uncovers distinct lipidome alterations in oropharyngeal squamous cell carcinoma (OPSCC) of the palatine tonsil. Several lipid species consistently differentiate tumor from healthy tissue, highlighting their potential as diagnostic markers.
Leonard Kerkhoff   +11 more
wiley   +1 more source

An Improved Shuffled Frog Leaping Algorithm for Assembly Sequence Planning of Remote Handling Maintenance in Radioactive Environment

open access: yesScience and Technology of Nuclear Installations, 2015
Assembly sequence planning (ASP) of remote handling maintenance in radioactive environment is a combinatorial optimization problem. This study proposes an improved shuffled frog leaping algorithm (SFLA) for the combinatorial optimization problem of ASP ...
Jianwen Guo   +6 more
doaj   +1 more source

Crucial parameters for precise copy number variation detection in formalin‐fixed paraffin‐embedded solid cancer samples

open access: yesMolecular Oncology, EarlyView.
This study shows that copy number variations (CNVs) can be reliably detected in formalin‐fixed paraffin‐embedded (FFPE) solid cancer samples using ultra‐low‐pass whole‐genome sequencing, provided that key (pre)‐analytical parameters are optimized.
Hanne Goris   +10 more
wiley   +1 more source

Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems [PDF]

open access: yes, 2012
We introduce an algorithm design technique for a class of combinatorial optimization problems with concave costs. This technique yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists for the fixed-
Magnanti, Thomas L., Stratila, Dan
core   +2 more sources

Home - About - Disclaimer - Privacy