Results 51 to 60 of about 8,249,666 (288)
Are a set of microarrays independent of each other?
, 2009 Having observed an $m\times n$ matrix $X$ whose rows are possibly correlated, we wish to test the hypothesis that the columns are independent of each other. Our motivation comes from microarray studies, where the rows of $X$ record expression levels for $
Efron, Bradley
core +2 more sources
Clinical Insights Into Hypercalcemia of Malignancy in Childhood
Pediatric Blood &Cancer, EarlyView.ABSTRACT Hypercalcemia of malignancy (HCM) is a rare but life‐threatening metabolic emergency in children that occurs in less than 1% of pediatric cancer cases, with a reported incidence ranging from 0.4% to 1.0% across different studies. While it is observed in 10%–20% of adult malignancies, pediatric HCM remains relatively uncommon.
Hüseyin Anıl Korkmaz
wiley +1 more source
The Hilton-Spencer Cycle Theorems Via Katona’s Shadow Intersection Theorem
Discussiones Mathematicae Graph Theory, 2023 A family 𝒜 of sets is said to be intersecting if every two sets in 𝒜 intersect. An intersecting family is said to be trivial if its sets have a common element.
Borg Peter, Feghali Carl
doaj +1 more source
Quantum independent set problem and non-abelian adiabatic mixing
, 2019 We present an efficient quantum algorithm for some independent set problems in graph theory, based on non-abelian adiabatic mixing. We illustrate the performance of our algorithm with analysis and numerical calculations for two different types of graphs,
Wilczek, Frank, Wu, Biao, Yu, Hongye
core +1 more source
Independent Set, Induced Matching, and Pricing: Connections and Tight (Subexponential Time) Approximation Hardnesses [PDF]
, 2013 We present a series of almost settled inapproximability results for three fundamental problems. The first in our series is the subexponential-time inapproximability of the maximum independent set problem, a question studied in the area of parameterized ...
Chalermsook, Parinya +2 more
core +1 more source
Stable sets versus independent sets
Discrete Mathematics, 1993 The matroidal number \(m(G)\) of a graph \(G\) is defined as the smallest integer \(m\) so that the collection of the stable sets of \(G\) arises as \(I_ 1\cup I_ 2 \cup \cdots \cup I_ m\) where the \(I_ i\) are collections of independent sets of matroids on the vertex set of \(G\).
openaire +2 more sources
Pediatric Blood &Cancer, EarlyView.ABSTRACT Purpose Retinoblastoma (RB) is the most common pediatric ocular cancer, yet population‐based data on survival and risk factors remain limited. This study aimed to describe survival in a large national RB cohort and identify predictors of death and complications.
Samuel Sassine +14 more
wiley +1 more source
Domination, Eternal Domination, and Clique Covering
Discussiones Mathematicae Graph Theory, 2015 Eternal and m-eternal domination are concerned with using mobile guards to protect a graph against infinite sequences of attacks at vertices. Eternal domination allows one guard to move per attack, whereas more than one guard may move per attack in the m-
Klostermeyer William F., Mynhardt C.M.
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Objective To evaluate selumetinib exposure using therapeutic drug monitoring (TDM) in pediatric patients with neurofibromatosis type 1 (NF1) and plexiform neurofibromas (PN), assess interpatient pharmacokinetic variability, and explore the relationship between drug exposure, clinical response, and adverse effects.
Janka Kovács +8 more
wiley +1 more source
Independent point-set domination in line graphs
AKCE International Journal of Graphs and Combinatorics, 2021 Line graph of a graph G is an intersection graph of the edge set E(G) of G. In this paper, we obtain a sharp upper bound on the diameter of graph G whose line graph is an ipsd graph (graph possessing an independent point-set dominating set) by ...
Purnima Gupta, Alka Goyal, Ranjana Jain
doaj +1 more source