Results 61 to 70 of about 1,003,970 (287)
Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer
COLOSSUS project RAS‐mutated MSS colon cancer study explored transcriptomics and immune cell density by immunohistochemistry (IHC), Immunoscore (IS), ISIC/TuLIS scores, mutation counts, and detected different prevalences but similar microenvironment composition across immune markers with clinical relevance for future immunotherapy combination ...
Rodrigo Dienstmann +61 more
wiley +1 more source
Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems [PDF]
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
A note on the generalized min-sum set cover problem
In this paper, we consider the generalized min-sum set cover problem, introduced by Azar, Gamzu, and Yin. Bansal, Gupta, and Krishnaswamy give a 485-approximation algorithm for the problem. We are able to alter their algorithm and analysis to obtain a 28-
Skutella, Martin, Williamson, David P.
core +1 more source
Keratin 19 (KRT19) is overexpressed in high‐grade serous ovarian cancer with high levels of Kallikrein‐related peptidases (KLK) 4–7 and is associated with poor survival. In vivo analyses demonstrate that elevated KRT19 increases peritoneal tumour burden.
Sophia Bielesch +13 more
wiley +1 more source
Approximation of Queues in Bike-Sharing Systems With Finite Docks
This paper presents a closed queuing network model to address bike queues in bike-sharing systems with finite docks. The model tackles issues of bike spillover and user attrition due to fully occupied docks and bike shortages at stations.
Xiang PENG, Jingyan WANG, Yong ZHANG
doaj +1 more source
Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks [PDF]
In this paper, we consider the problem of scheduling independent parallel tasks in parallel systems with identical processors. The problem is NP-hard, since it includes the bin packing problem as a special case when all tasks have unit execution time. We
Keqin Li
doaj +1 more source
In this paper, we consider parallel-machine scheduling with release times and submodular penalties (P|rj,reject|Cmax+π(R)), in which each job can be accepted and processed on one of m identical parallel machines or rejected, but a penalty must paid if a ...
Wencheng Wang, Xiaofei Liu
doaj +1 more source
Improved Approximation Algorithms for k-Submodular Function Maximization
This paper presents a polynomial-time $1/2$-approximation algorithm for maximizing nonnegative $k$-submodular functions. This improves upon the previous $\max\{1/3, 1/(1+a)\}$-approximation by Ward and \v{Z}ivn\'y~(SODA'14), where $a=\max\{1, \sqrt{(k-1)/
Iwata, Satoru +2 more
core +1 more source
Somatic mutational landscape in von Hippel–Lindau familial hemangioblastoma
The causes of central nervous system (CNS) hemangioblastoma in Von Hippel–Lindau (vHL) disease are unclear. We used Whole Exome Sequencing (WES) on familial hemangioblastoma to investigate events that underlie tumor development. Our findings suggest that VHL loss creates a permissive environment for tumor formation, while additional alterations ...
Maja Dembic +5 more
wiley +1 more source
Adaptive variational discretization approximation method for parabolic optimal control problems
In this paper, we study variational discretization method for parabolic optimization problems. Firstly, we obtain some convergence and superconvergence analysis results of the approximation scheme.
Yuelong Tang, Yuchun Hua
doaj +1 more source

