Results 121 to 130 of about 178,314 (358)
Robust optimal graph clustering
Most graph-based clustering methods separate the graph construction and clustering into two independent processes. The manually pre-constructed graph may not be suitable for the subsequent clustering.
Zhu, L +5 more
core +1 more source
Optimizing photoactivation of PA‐mCherry for optical pooled CRISPR screens
Photoactivatable PA‐mCherry finds widespread use to optically tag individual cells. However, confocal 405 nm UV laser‐scanning (normal scan) is much less efficient than widefield UV illumination, limiting the use of PA‐mCherry on confocal instruments. We remedy this limitation by reporting that rapid and repeated confocal scanning with a low‐intensity,
Sravasti Mukherjee +3 more
wiley +1 more source
Graph Homomorphism Revisited for Graph Matching
In a variety of emerging applications one needs to decide whether a graph G matches another Gp, i.e., whether G has a topological structure similar to that of Gp. The traditional notions of graph homomorphism and isomorphism often fall short of capturing
Li, Jianzhong +4 more
core
Representing Space: A Hybrid Genetic Algorithm for Aesthetic Graph Layout [PDF]
This paper describes a hybrid Genetic Algorithm (GA) that is used to improve the layout of a graph according to a number of aesthetic criteria.
Rodgers, Peter, Hobbs, M.H.W.
core
A Graph-based Image Clustering Method Using Mutual Information Maximization
In this paper, we present a novel image clustering method that converts a typical image clustering problem into a graph node classification task, given only unlabelled data samples.
Gao, Y +5 more
core +1 more source
Automatic classification of protein structures relying on similarities between alignments
Background Identification of protein structural cores requires isolation of sets of proteins all sharing a same subset of structural motifs. In the context of an ever growing number of available 3D protein structures, standard and automatic clustering ...
Santini Guillaume +2 more
doaj +1 more source
In a murine model of myocardial ischemia and reperfusion (MI/R), the CD36 azapeptide ligand MPE‐298 reduces cardiac injury and transiently lowers left ventricular long‐chain fatty acids (LCFAs) accumulation 3 h after reperfusion, accompanied by a decrease of oxidative stress and inflammation‐associated genes' expression in the heart and adipose tissue.
Jade Gauvin +12 more
wiley +1 more source
Beyond spectral clustering - tight relaxations of balanced graph cuts
Spectral clustering is based on the spectral relaxation of the normalized/ratio graph cut criterion. While the spectral relaxation is known to be loose, it has been shown recently that a non-linear eigenproblem yields a tight relaxation of the Cheeger ...
Hein, Matthias +3 more
core
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
Multi-view dual anchor graph fuzzy clustering
In recent years, with the rapid development of multi-view learning, how to effectively integrate information from different views for clustering analysis has become an important research topic in both academia and industry,driving the emergence of ...
ZHU Chenghao;DING Weiping;ZHANG Wei
doaj +1 more source

