Results 61 to 70 of about 750,144 (292)

Surfaceome: a new era in the discovery of immune evasion mechanisms of circulating tumor cells

Molecular Oncology, EarlyView.
In the era of immunotherapies, many patients either do not respond or eventually develop resistance. We propose to pave the way for proteomic analysis of surface‐expressed proteins called surfaceome, of circulating tumor cells. This approach seeks to identify immune evasion mechanisms and discover potential therapeutic targets. Circulating tumor cells (
Doryan Masmoudi, Jérome Vialaret, Christophe Hirtz, Catherine Alix‐Panabières   +3 more
wiley   +1 more source

Which solutions of the third problem for the Poisson equation are bounded?

Abstract and Applied Analysis, 2004
This paper deals with the problem Δu=g on G and ∂u/∂n+uf=L on ∂G. Here, G⊂ℝm, m>2, is a bounded domain with Lyapunov boundary, f is a bounded nonnegative function on the boundary of G, L is a bounded linear functional on W1,2(G) representable by a real ...
Dagmar Medková
doaj   +1 more source

Clinical applications of next‐generation sequencing‐based ctDNA analyses in breast cancer: defining treatment targets and dynamic changes during disease progression

Molecular Oncology, EarlyView.
Circulating tumor DNA (ctDNA) offers a possibility for different applications in early and late stage breast cancer management. In early breast cancer tumor informed approaches are increasingly used for detecting molecular residual disease (MRD) and early recurrence. In advanced stage, ctDNA provides a possibility for monitoring disease progression and
Eva Valentina Klocker, Samantha Hasenleithner, Rupert Bartsch, Simon P. Gampenrieder, Daniel Egle, Christian F. Singer, Gabriel Rinnerthaler, Michael Hubalek, Katja Schmitz, Zsuzsanna Bago‐Horvath, Andreas Petzer, Sonja Heibl, Ellen Heitzer, Marija Balic, Michael Gnant   +14 more
wiley   +1 more source

A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints [PDF]

26th International Symposium on Theoretical Aspects of Computer Science - STACS 2009 (2009) 433-444, 2009
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of stable set polytope. We apply it to majority functions and prove their formula size lower bounds improved from the classical result of Khrapchenko [13].
arxiv  

NanoCMSer: a consensus molecular subtype stratification tool for fresh‐frozen and paraffin‐embedded colorectal cancer samples

Molecular Oncology, EarlyView.
Consensus molecular subtypes (CMS1‐4) have been identified to study colorectal cancer heterogeneity and serve as potential biomarkers. In this study, we developed and evaluated NanoCMSer, a NanoString‐based classifier using 55 genes, optimized for FF and FFPE to facilitate the clinical evaluation of CMS subtyping.
Arezo Torang, Simone van de Weerd, Veerle Lammers, Sander van Hooff, Inge van den Berg, Saskia van den Bergh, Miriam Koopman, Jan N. IJzermans, Jeanine M. L. Roodhart, Jan Koster, Jan Paul Medema   +10 more
wiley   +1 more source

Non-homogeneous directional equations: Slice solutions belonging to functions of bounded $L$-index in the unit ball [PDF]

Mathematica Bohemica
For a given direction $ b\in\mathbb{C}^n\setminus\{0\}$ we study non-homogeneous directional linear higher-order equations whose all coefficients belong to a class of joint continuous functions which are holomorphic on intersection of all directional ...
Andriy Bandura, Tetyana Salo, Oleh Skaskiv   +2 more
doaj   +1 more source

Addressing persistent challenges in digital image analysis of cancer tissue: resources developed from a hackathon

Molecular Oncology, EarlyView.
Large multidimensional digital images of cancer tissue are becoming prolific, but many challenges exist to automatically extract relevant information from them using computational tools. We describe publicly available resources that have been developed jointly by expert and non‐expert computational biologists working together during a virtual hackathon
Sandhya Prabhakaran, Clarence Yapp, Gregory J. Baker, Johanna Beyer, Young Hwan Chang, Allison L. Creason, Robert Krueger, Jeremy Muhlich, Nathan Heath Patterson, Kevin Sidak, Damir Sudar, Adam J. Taylor, Luke Ternes, Jakob Troidl, Xie Yubin, Artem Sokolov, Darren R. Tyson   +16 more
wiley   +1 more source

Functions of bounded (2,k)-variation in 2-normed spaces

AIMS Mathematics
In this work, the notion of function of bounded variation in 2-normed spaces was established (Definition 4.2), the set of functions of bounded $ (2, k) $-variation was endowed with a norm (Theorem 4.5), and it was proved that such a set is a Banach space
Cure Arenas Jaffeth , Ferrer Sotelo Kandy , Ferrer Villar Osmin   +2 more
doaj   +1 more source

On strongly starlike and strongly convex functions with bounded radius and bounded boundary rotation

Journal of Inequalities and Applications, 2020
In this paper, we introduce and investigate new classes of normalized analytic functions in an open unit disk with bounded radius and bounded boundary rotation by using the subordination.
Sabir Hussain, Khalil Ahmad
doaj   +1 more source

Perceptron Mistake Bounds [PDF]

arXiv, 2013
We present a brief survey of existing mistake bounds and introduce novel bounds for the Perceptron or the kernel Perceptron algorithm. Our novel bounds generalize beyond standard margin-loss type bounds, allow for any convex and Lipschitz loss function, and admit a very simple proof.
arxiv