Results 91 to 100 of about 2,131,360 (300)
Cluster validity indices for automatic clustering: A comprehensive review
The Cluster Validity Index is an integral part of clustering algorithms. It evaluates inter-cluster separation and intra-cluster cohesion of candidate clusters to determine the quality of potential solutions.
Abiodun M. Ikotun +2 more
doaj +1 more source
Transcripts enriched in codons that trigger P‐site tRNA‐mediated mRNA decay possess stable mRNA
PTMD codons were first described by Mendel et al. as mediators of an mRNA decay pathway dependent on the human protein CNOT3, homologous to yeast Not5. Our findings confirm that PTMD codons destabilize transcripts; however, unlike in yeast, the human pathway specifically targets and slightly destabilizes primarily stable mRNAs.
Rodolfo Lopes Carneiro +1 more
wiley +1 more source
Cluster Validity and Stability of Clustering Algorithms [PDF]
For many clustering algorithms, it is very important to determine an appropriate number of clusters, which is called cluster validity problem. In this paper, we offer a new approach to tackle this issue. The main point is that the better outputs of clustering algorithm, the more stable.
Jian Yu 0001 +2 more
openaire +1 more source
Global Optimization strategies for two-mode clustering [PDF]
Two-mode clustering is a relatively new form of clustering that clusters both rows and columns of a data matrix. To do so, a criterion similar to k-means is optimized.
Castilli, W. +3 more
core
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
Two Medoid-Based Algorithms for Clustering Sets
This paper proposes two algorithms for clustering data, which are variable-sized sets of elementary items. An example of such data occurs in the analysis of a medical diagnosis, where the goal is to detect human subjects who share common diseases to ...
Pasi Fränti, Libero Nigro
core +1 more source
Comparative assessment of crystallographic and cryo‐EM models in the Protein Data Bank
Raw data obtained by X‐ray crystallography or cryo‐EM result in experimental maps, ultimately fitted by atomic models. Although the physical principles are different, the final results can be viewed, compared, and evaluated in the same way. With cryogenic electron microscopy (cryo‐EM) on track to surpass X‐ray crystallography as the preferred method ...
Alexander Wlodawer +7 more
wiley +1 more source
Efficient Multiple Kernel k-Means Clustering With Late Fusion
The recently proposed multiple-kernel clustering algorithms have demonstrated promising performance in various applications. However, most of the existing methods suffer from high computational complexity and intensive time cost.
Siwei Wang +6 more
doaj +1 more source
Multicanonical cluster algorithm
4 pages, 4 ps-figures, LATTICE '92 contribution. Latex, uses espcrc2.sty (available from hep-lat, use Subj: get espcrc2.sty).
openaire +2 more sources
In this study, a novel esterase from the thermoacidophilic archaeon Thermoplasma acidophilum was biochemically and structurally characterized. Our results demonstrate that Ta0887 is a highly thermostable esterase that preferentially hydrolyzes p‐nitrophenyl hexanoate and possesses an α‐helical cap domain that likely contributes to its substrate ...
Alejandro Delgado‐Rey +4 more
wiley +1 more source

