Results 71 to 80 of about 3,054,349 (257)
Molecular Oncology, EarlyView.Detecting circulating tumor cells (CTCs) in blood before surgery may help predict outcomes in patients with head and neck squamous cell carcinoma (HNSCC). Here, we show when combined with tumor size and lymph node involvement from routine imaging, CTC status identifies high‐risk patients with poorer survival—offering a simple, minimally invasive tool ...
Susanne Flach +9 more
wiley +1 more source
On the Approximation Resistance of a Random Predicate
, 2007 A predicate is approximation resistant if no probabilistic polynomial time approximation algorithm can do significantly better then the naive algorithm that picks an assignment uniformly at random.
Håstad, Johan,, Johan Håstad
core +1 more source
AlgorithmsIn this paper, we present a new distributed approximation algorithm for the minimum dominating set problem in planar triangle-free graphs. The algorithm operates in a constant number of rounds in the LOCAL model.
Wojciech Wawrzyniak
doaj +1 more source
On Efficient Deployment of Wireless Sensors for Coverage and Connectivity in Constrained 3D Space
Sensors, 2017 Sensor networks have been used in a rapidly increasing number of applications in many fields. This work generalizes a sensor deployment problem to place a minimum set of wireless sensors at candidate locations in constrained 3D space to k-cover a given ...
Chase Q. Wu, Li Wang
doaj +1 more source
Molecular Oncology, EarlyView.This study integrates publicly available transcriptomic datasets to identify molecular signatures associated with response to neoadjuvant chemoradiotherapy in locally advanced rectal cancer. By analyzing a combination of multiple cohorts with bioinformatics approaches, we reveal biological pathways and immune‐related features that may improve ...
Aleksandra Stanojevic +10 more
wiley +1 more source
A 3-approximation algorithm for the subtree distance between phylogenies [PDF]
, 2008 In this paper, we give a (polynomial-time) 3-approximation algorithm for the rooted subtree prune and regraft distance between two phylogenetic trees. This problem is known to be NP-complete and the best previously known approximation algorithm is a 5 ...
McCartin, C., Semple, C., Bordewich, M.
core +1 more source
Molecular Oncology, EarlyView.Incomplete microwave ablation (iMWA) of liver cancer triggers a biphasic progression in residual tumors. At Day 3, the microenvironment is characterized by acute inflammatory responses and extracellular matrix (ECM) remodeling. By Day 14, a profound shift occurs toward oncogenic signal transduction and immunosuppression, marked by macrophage ...
Yu Liu +9 more
wiley +1 more source
Better approximation guarantees for job-shop scheduling [PDF]
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogarithmic) approximation guarantee.
Paterson, Michael S. +3 more
core
An algorithm for the quadratic approximation [PDF]
, 1984 The quadratic approximation is a three dimensional analogue of the two dimensional Pade approximation. A determinantal expression for the polynomial coefficients of the quadratic approximation is given.
Loi, S.L., McInnes, A. W.
core +1 more source
Molecular Oncology, EarlyView.Circulating microRNA profiles distinguish nonmalignant Lynch syndrome from cancer‐associated Lynch syndrome, sporadic colorectal cancer, and healthy controls. Age‐stratified analysis reveals disease‐specific regulatory states, and a six‐miRNA panel shows concordant separation in an independent colorectal tissue cohort.
Ramadhani Salum Chambuso +5 more
wiley +1 more source