Results 71 to 80 of about 1,007,914 (329)

Approximation algorithms for a sequencing problem with a biased bipartite structure

Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2016
Given a family of m + 1 sets of n vertices in a metric space, a bi-level optimization problem to be considered in this paper asks to find a minimum cost repetitive walk with a prescribed terminal vertex.
Aleksandar SHURBEVSKI, Hiroshi NAGAMOCHI, Yoshiyuki KARUNO   +2 more
doaj   +1 more source

A note on the generalized min-sum set cover problem

, 2011
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

Genetic attenuation of ALDH1A1 increases metastatic potential and aggressiveness in colorectal cancer

Molecular Oncology, EarlyView.
Aldehyde dehydrogenase 1A1 (ALDH1A1) is a cancer stem cell marker in several malignancies. We established a novel epithelial cell line from rectal adenocarcinoma with unique overexpression of this enzyme. Genetic attenuation of ALDH1A1 led to increased invasive capacity and metastatic potential, the inhibition of proliferation activity, and ultimately ...
Martina Poturnajova, Zuzana Kozovska, Ondrej Pos, Kristina Pavlov, Sachin Gulati, Peter Makovicky, Kristina Jakic, Monika Burikova, Eva Sedlackova, Barbora Svitkova, Silvia Tyciakova, Vojtech Bystry, Nicolas Blavet, Boris Tichy, Matej Hrnciar, Jaroslav Budis, Miroslav Tomas, Peter Dubovan, Georgina Kolnikova, Veronika Repaska, Nikoleta Mojzesova, Eva Zomborska, Daniel Pindak, Michal Mego, Tomas Szemes, Miroslava Matuskova   +25 more
wiley   +1 more source

Network divergence analysis identifies adaptive gene modules and two orthogonal vulnerability axes in pancreatic cancer

Molecular Oncology, EarlyView.
Tumors contain diverse cellular states whose behavior is shaped by context‐dependent gene coordination. By comparing gene–gene relationships across biological contexts, we identify adaptive transcriptional modules that reorganize into distinct vulnerability axes.
Brian Nelson, Lyanne Delgado‐Coka, Natalia Marchenko, Luisa F. Escobar‐Hoyos, Kenneth R. Shroyer, Alisa Yurovsky, Trey Ideker, Gábor Balázsi, Thomas MacCarthy, Scott Powers   +9 more
wiley   +1 more source

An improved Alpha approximation algorithm for time-series surface soil moisture inversion from Sentinel-1 SAR data

International Journal of Applied Earth Observations and Geoinformation
Accurate measurement of soil moisture content has significant scientific value and social benefits for studying global or regional water cycle mechanisms, developing climate and hydrological models, and advancing sustainable agricultural development. The
Leilei Dong, Tao Che, Xin Huang, Xingze Li, Haining Wei, Feinan Xu, Weizhen Wang   +6 more
doaj   +1 more source

Constrained Submodular Maximization: Beyond 1/e

, 2016
In this work, we present a new algorithm for maximizing a non-monotone submodular function subject to a general constraint. Our algorithm finds an approximate fractional solution for maximizing the multilinear extension of the function over a down-closed
Ene, Alina, Nguyen, Huy L.
core   +1 more source

A Constant Approximation Algorithm for Sequential Random-Order\n No-Substitution k-Median Clustering [PDF]

, 2021
Tom Hess, Michal Moshkovitz, Sivan Sabato   +2 more
openalex   +1 more source

Interrogating the immune landscape of microsatellite stable RAS‐mutated colon cancer

Molecular Oncology, EarlyView.
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, Eduardo García‐Galea, Alice O'Farrell, Zak Kinsella, Maxime Meylan, Florent Petitprez, Ingrid Arijs, Tom Venken, Hari Ps, Adrian Lärkeryd, Ian Miller, Janick Selves, Nadja Meindl‐Beinker, Fiorella Ruiz‐Pace, Elena Élez, Raquel Comas‐Navarro, Frank Lincoln, Dirk Fey, Gift Nyamundanda, Aoife Nolan, Joern Lewin, Raquel Perez‐Lopez, Jonathan Briody, Kathleen Bennett, Walter Kolch, David Matallanas, Alexander Kel, Enrique Arenas, Joaquín Arribas, Bart Ghesquière, Josep Tabernero, Julie Meilleroux, Deborah McNamara, Ray McDermott, Marvin Lim, Mary O'Reilly, Brian Bird, Lisa Stack, Lucia Moloney, Patrick Morris, Keith Egan, Maciej Milewski, Lars Scheuer, Joachim Behringer, Georg Bolz, Ramon Salazar, Cristina Santos, Andrea Ruiz, Orla Casey, Verena Murphy, Matthias Ebert, Livio Trusolino, Diether Lambrechts, Anguraj Sadanandam, Catherine Sautès‐Fridman, Jochen Prehn, Paolo Nuciforo, Jacques Fieschi, Florence Monville, Darran O'Connor, Wolf Fridman, Annette Byrne   +61 more
wiley   +1 more source

Course Sequence Recommendation with Course Difficulty Index Using Subset Sum Approximation Algorithms

Cybernetics and Information Technologies, 2019
Choice Based Course Selection (CBCS) allows students to select courses based on their preferred sequence. This preference in selection is normally bounded by constraints set by a university like pre-requisite(s), minimum and maximum number of credits ...
Premalatha M., Viswanathan V.
doaj   +1 more source

Approximating the MaxCover Problem with Bounded Frequencies in FPT Time [PDF]

, 2013
We study approximation algorithms for several variants of the MaxCover problem, with the focus on algorithms that run in FPT time. In the MaxCover problem we are given a set N of elements, a family S of subsets of N, and an integer K. The goal is to find
Faliszewski, Piotr, Skowron, Piotr
core