Results 51 to 60 of about 42,601 (304)

Somatic mutational landscape in von Hippel–Lindau familial hemangioblastoma

open access: yesMolecular Oncology, EarlyView.
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

Correntropy Based Matrix Completion

open access: yesEntropy, 2018
This paper studies the matrix completion problems when the entries are contaminated by non-Gaussian noise or outliers. The proposed approach employs a nonconvex loss function induced by the maximum correntropy criterion.
Yuning Yang   +2 more
doaj   +1 more source

MITF maintains genome stability in nonmelanocyte lineages

open access: yesMolecular Oncology, EarlyView.
MITF is essential for melanocyte survival and acts as an oncogene in 10%–20% of melanomas. We show that MITF depletion causes genome instability in nonmelanocytic cells, leading to LATS2‐mediated P53 activation, cell cycle arrest, and apoptosis. This study highlights the role of MITF as a genome maintenance factor beyond the melanocyte lineage. Created
Drifa H. Gudmundsdottir   +13 more
wiley   +1 more source

Neutrosophic Completion Technique for Incomplete Higher-Order AHP Comparison Matrices

open access: yesMathematics, 2021
After the recent establishment of the Sustainable Development Goals and the Agenda 2030, the sustainable design of products in general and infrastructures in particular emerge as a challenging field for the development and application of multicriteria ...
Ignacio J. Navarro   +2 more
doaj   +1 more source

The nonnegative P_0-matrix completion problem

open access: yesThe Electronic Journal of Linear Algebra, 2003
Let \({\mathcal N}= \{1,2,\dots,n\}\) and \(Q\) be a subset of \({\mathcal N}\times{\mathcal N}\). The digraph of \(Q\) is the digraph having vertex set \({\mathcal N}\) and as arcs, the ordered pairs \((i,j)\in Q\) where \(i\neq j\). Assume that \((i,i)\in Q\) for all \(i\in{\mathcal N}\).
Choi, Ji Young   +5 more
openaire   +3 more sources

Single‐cell DNA methylation profiling: Technologies, computation, and applications in precision oncology

open access: yesMolecular Oncology, EarlyView.
Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley   +1 more source

An Improved Alternating Direction Method of Multipliers for Matrix Completion

open access: yesFoundations of Computing and Decision Sciences
Matrix completion is widely used in information science fields such as machine learning and image processing. The alternating direction method of multipliers (ADMM), due to its ability to utilize the separable structure of the objective function, has ...
Yan Xihong, Zhang Ning, Li Hao
doaj   +1 more source

Strong NP-completeness of a matrix similarity problem

open access: yesTheoretical Computer Science, 1996
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
V. BRIMKOV   +3 more
openaire   +3 more sources

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

open access: yesFEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill   +4 more
wiley   +1 more source

A Fast Designed Thresholding Algorithm for Low-Rank Matrix Recovery with Application to Missing English Text Completion

open access: yesMathematics
This article is proposing a fast version of adaptive iterative matrix designed thresholding (AIMDT) algorithm which is studied in our previous work. In AIMDT algorithm, a designed thresholding operator is studied to the problem of recovering the low-rank
Haizhen He, Angang Cui, Hong Yang
doaj   +1 more source

Home - About - Disclaimer - Privacy