Results 91 to 100 of about 1,195,838 (307)
Tangles and Hierarchical Clustering
An extended abstract that contains some of the results has appeared at MFCS ...
openaire +5 more sources
UiO‐66(Zr) metal–organic frameworks are chemically stable, biocompatible, and highly tunable nanomaterials. Their modular structure enables controlled drug delivery, multimodal bioimaging, and light‐activated photodynamic therapy, supporting integrated diagnostic and therapeutic (theranostic) applications in cancer and biomedical research.
Veronika Huntošová +2 more
wiley +1 more source
Functorial hierarchical clustering with overlaps
Minor revisions.
Jared Culbertson +2 more
openaire +6 more sources
Differentially Private Hierarchical Spectral Clustering
We study hierarchical spectral graph clustering under edge differential privacy (DP) through the lens of iterative eigenvector estimation on adjacency matrices. We propose a differentially private recursive spectral framework, where each binary partition
Mohamed Seif Mohamed +1 more
doaj +1 more source
Assessment of Heart Disease using Fuzzy Classification Techniques
In this paper we discuss the classification results of cardiac patients of ischemical cardiopathy, valvular heart disease, and arterial hypertension, based on 19 characteristics (descriptors) including ECHO data, effort testings, and age and weight.
Horia F. Pop, Tudor L. Pop, Costel Sarbu
doaj +1 more source
Accurate and noninvasive prostate cancer detection using plasma‐derived extracellular vesicle RNA
Plasma extracellular vesicles were captured with WGA‐conjugated magnetic beads and profiled for RNA biomarkers. A three‐RNA panel (NM_024955, NR_047469, and NR_002564) distinguished prostate cancer from healthy controls and benign prostatic hyperplasia, supporting a simple, noninvasive approach to improve prostate cancer detection.
Hanping Wei, Haoran Wu, Wei Feng
wiley +1 more source
Hierarchical Clusterings of Unweighted Graphs
We study the complexity of finding an optimal hierarchical clustering of an unweighted similarity graph under the recently introduced Dasgupta objective function. We introduce a proof technique, called the normalization procedure, that takes any such clustering of a graph $G$ and iteratively improves it until a desired target clustering of G is reached.
Hogemo, Svein +2 more
openaire +6 more sources
Evolution‐guided yeast complementation reveals functional differences in human PSPH variants
Ancient genomes can help guide which human genetic variants are tested experimentally. This study applies that idea to PSPH, a gene involved in serine biosynthesis, and uses high‐throughput yeast complementation to compare variant function. The findings reveal measurable differences among selected alleles and illustrate the value of evolution‐guided ...
Mauricio Campa‐Álvarez +6 more
wiley +1 more source
Hierarchical clustering of maximum parsimony reconciliations
Background Maximum parsimony reconciliation in the duplication-transfer-loss model is a widely-used method for analyzing the evolutionary histories of pairs of entities such as hosts and parasites, symbiont species, and species and genes. While efficient
Ross Mawhorter, Ran Libeskind-Hadas
doaj +1 more source
Natural Frequencies of Levodopa‐Induced Dyskinesia in Parkinson's Disease
ABSTRACT Objectives Abnormal involuntary movements, known as dyskinesias, are common complications of levodopa treatment in patients with Parkinson's disease and can significantly impair quality of life. The underlying pathophysiology remains unclear, and current therapeutic options are limited.
Ioannis U. Isaias +3 more
wiley +1 more source

