Results 81 to 90 of about 522,654 (284)
Submodular meets Spectral: Greedy Algorithms for Subset Selection, Sparse Approximation and Dictionary Selection [PDF]
We study the problem of selecting a subset of k random variables from a large set, in order to obtain the best linear prediction of another variable of interest. This problem can be viewed in the context of both feature selection and sparse approximation.
Das, Abhimanyu, Kempe, David
core
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
Peroxidasin enables melanoma immune escape by inhibiting natural killer cell cytotoxicity
Peroxidasin (PXDN) is secreted by melanoma cells and binds the NK cell receptor NKG2D, thereby suppressing NK cell activation and cytotoxicity. PXDN depletion restores NKG2D signaling and enables effective NK cell–mediated melanoma killing. These findings identify PXDN as a previously unrecognized immune evasion factor and a potential target to improve
Hsu‐Min Sung +17 more
wiley +1 more source
Binary Social Mimic Optimization Algorithm With X-Shaped Transfer Function for Feature Selection
Definitive optimization algorithms are not able to solve high dimensional optimization problems when the search space grows exponentially with the problem size, and an exhaustive search also becomes impractical. To encounter this problem, researchers use
Kushal Kanti Ghosh +4 more
doaj +1 more source
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
Algorithmic Cluster Expansions for Quantum Problems
We establish a general framework for developing approximation algorithms for a class of counting problems. Our framework is based on the cluster expansion of the abstract polymer model formalism of Kotecký and Preiss.
Ryan L. Mann, Romy M. Minko
doaj +1 more source
Tumor mutational burden as a determinant of metastatic dissemination patterns
This study performed a comprehensive analysis of genomic data to elucidate whether metastasis in certain organs share genetic characteristics regardless of cancer type. No robust mutational patterns were identified across different metastatic locations and cancer types.
Eduardo Candeal +4 more
wiley +1 more source
To integrate multiple transcriptomics data with severe batch effects for identifying MB subtypes, we developed a novel and accurate computational method named RaMBat, which leveraged subtype‐specific gene expression ranking information instead of absolute gene expression levels to address batch effects of diverse data sources.
Mengtao Sun, Jieqiong Wang, Shibiao Wan
wiley +1 more source
Meta‐transcriptome analysis identified FGF19 as a peptide enteroendocrine hormone associated with colorectal cancer prognosis. In vivo xenograft models showed release of FGF19 into the blood at levels that correlated with tumor volumes. Tumoral‐FGF19 altered murine liver metabolism through FGFR4, thereby reducing bile acid synthesis and increasing ...
Jordan M. Beardsley +5 more
wiley +1 more source
We study a multi-product production and inventory planning problem with uncertain demand in the cold rolling stage of steel production processes. The problem is to determine the production amount of each product in each planning period so that the sum of
Jing Wu +3 more
doaj +1 more source

