Results 141 to 150 of about 8,222,439 (341)
Molecular Oncology, EarlyView.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
The connectivity degree controls the difficulty in reservoir design of random boolean networks
Frontiers in Computational NeuroscienceReservoir Computing (RC) is a paradigm in artificial intelligence where a recurrent neural network (RNN) is used to process temporal data, leveraging the inherent dynamical properties of the reservoir to perform complex computations.
Emmanuel Calvet +2 more
doaj +1 more source
Regularity for almost minimizers with free boundary
, 2013 In this paper we study the local regularity of almost minimizers of the functional \begin{equation*} J(u)=\int_\Omega |\nabla u(x)|^2 +q^2_+(x)\chi_{\{u>0\}}(x) +q^2_-(x)\chi_ ...
David, Guy, Toro, Tatiana
core
Basroparib inhibits YAP‐driven cancers by stabilizing angiomotin
Molecular Oncology, EarlyView.Basroparib, a selective tankyrase inhibitor, suppresses Wnt signaling and attenuates YAP‐driven oncogenic programs by stabilizing angiomotin. It promotes AMOT–YAP complex formation, enforces cytoplasmic YAP sequestration, inhibits YAP/TEAD transcription, and sensitizes YAP‐active cancers, including KRAS‐mutant colorectal cancer, to MEK inhibition.
Young‐Ju Kwon +4 more
wiley +1 more source
Publisher’s Note: Spatial Search by Quantum Walk is Optimal for Almost All Graphs [Phys. Rev. Lett.116, 100501 (2016)] [PDF]
, 2016 Shantanav Chakraborty +3 more
openalex +1 more source
Molecular Oncology, EarlyView.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
A polynomial-time algorithm for computing a Pareto optimal and almost\n proportional allocation [PDF]
, 2019 Haris Aziz +2 more
openalex +1 more source
Optimal and Almost Optimal Locally Repairable Codes From Hyperelliptic Curves
IEEE Transactions on Information TheoryLocally repairable codes are widely applicable in contemporary large-scale distributed cloud storage systems and various other areas. By making use of some algebraic structures of elliptic curves, Li et al. developed a series of $q$-ary optimal locally repairable codes with lengths that can extend to $q+2\sqrt{q}$.
Junjie Huang, Chang-An Zhao
openaire +2 more sources
Rethinking plastic waste: innovations in enzymatic breakdown of oil‐based polyesters and bioplastics
FEBS Open Bio, EarlyView.Plastic pollution remains a critical environmental challenge, and current mechanical and chemical recycling methods are insufficient to achieve a fully circular economy. This review highlights recent breakthroughs in the enzymatic depolymerization of both oil‐derived polyesters and bioplastics, including high‐throughput protein engineering, de novo ...
Elena Rosini +2 more
wiley +1 more source
Combinational optimization problems for which almost every algorithm is asymptotically optimal
Optimization, 1995 Let Zmax and Zmin be respectively the maximum and minimum of the objective function in a combinatorial problem for which the cardinality of the set of feasible solutions is m and the size of every feasible solution is N. We prove that in a certain probabilistic framework Zmax ~ Zmin almost surely (a.s.) provided log m = o (N) for N and m become large ...
openaire +3 more sources