Results 61 to 70 of about 445,292 (276)

Clinical, Histopathological, and Molecular Characterization of Pediatric MN1::ZNF341‐Associated Cancer

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT A lethal round‐cell malignancy with an MN1::ZNF341 fusion has recently been reported in three infants. Here, we describe four further tumors, three in newborns (including monozygotic twins), and one in an adolescent. Detailed clinical, radiological, and histopathological data differentiate these tumors from their main mimics, neuroblastoma and
Thomas R. W. Oliver   +25 more
wiley   +1 more source

A Note on the Total Detection Numbers of Cycles

open access: yesDiscussiones Mathematicae Graph Theory, 2015
Let G be a connected graph of size at least 2 and c :E(G)→{0, 1, . . . , k− 1} an edge coloring (or labeling) of G using k labels, where adjacent edges may be assigned the same label. For each vertex v of G, the color code of v with respect to c is the k-
Escuadro Henry E.   +2 more
doaj   +1 more source

Changing, Annulling and Otherwising the Past

open access: yesPhilosophies, 2021
Despite a growing number of models argument for the logical possibility of changing the past there continues to be resistance to and confusion surrounding the possibility of changing the past.
G. C. Goddu
doaj   +1 more source

Solid Pseudopapillary Neoplasm of the Pancreas in Children and Adolescents: Expert Recommendations

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Solid pseudopapillary neoplasm of the pancreas (SPN) is a rare low‐grade malignant exocrine pancreatic tumor, mostly discovered during the second decade of life in females, with a very good prognosis, provided microscopically complete surgical excision is achieved.
Sabine Irtan   +18 more
wiley   +1 more source

The distinguishing number of semiprimitive groups [PDF]

open access: yes, 2019
The distinguishing number of a permutation group $G \leq \Sym(X)$ is the smallest number of colours required to colour the points of $X$ such that only the identity of $G$ preserves the colouring.
Harper, Scott
core  

Distinguishing between lepton number violating scalars at the LHC

open access: yesEPJ Web of Conferences, 2013
Scalars with lepton number violating interactions decaying into lepton pairs, as those mediating the see-saw of type II, always include doubly-charged components.
Santamaria Arcadi   +3 more
doaj   +1 more source

The chromatic distinguishing index of certain graphs

open access: yesAKCE International Journal of Graphs and Combinatorics, 2020
The distinguishing index of a graph , denoted by , is the least number of labels in an edge coloring of not preserved by any non-trivial automorphism. The distinguishing chromatic index of a graph is the least number such that has a proper edge coloring ...
Saeid Alikhani, Samaneh Soltani
doaj   +1 more source

Bridging the Gap in Neuroblastoma Care: Consensus‐Based Statements With Recommendations for Improved Patient and Caregiver Experiences

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Neuroblastoma's complex, heterogeneous biology poses significant diagnostic and therapeutic challenges, often requiring caregivers to absorb complex information and participate in time‐sensitive decisions. However, caregivers often feel unprepared to evaluate options.
Vickie Buenger   +8 more
wiley   +1 more source

Smarandachely Adjacent Vertex Distinguishing Edge Coloring Algorithm of Graphs [PDF]

open access: yesJisuanji gongcheng, 2017
To solve the problem of Smarandachely Adjacent Vertex Distinguishing Edge Coloring(SAVDEC) of graphs,this paper presents a coloring algorithm based on multi-objective optimization.For each sub problem,the sub objective function vector and decision space ...
CAO Daotong,LI Jingwen,WEN Fei
doaj   +1 more source

Motion and distinguishing number two

open access: yesArs Mathematica Contemporanea, 2011
A group A acting faithfully on a finite set X is said to have distinguishing number two if there is a proper subset Y whose (setwise) stabilizer is trivial. The motion of A acting on X is defined as the largest integer k such that all non-trivial elements of A move at least k elements of X .
Marston D. E. Conder, Thomas W. Tucker
openaire   +2 more sources

Home - About - Disclaimer - Privacy