Results 101 to 110 of about 768,033 (273)

A survey of kernel and spectral methods for clustering [PDF]

, 2007
Clustering algorithms are a useful tool to explore data structures and have been employed in many disciplines. The focus of this paper is the partitioning clustering problem with a special interest in two recent approaches: kernel and spectral methods ...
Masulli, F., CAMASTRA, Francesco, Francesco Camastra, Filippone, M., Maurizio Filippone, FILIPPONE M, Francesco Masulli, Camastra, F., ROVETTA S., MASULLI F, Stefano Rovetta, Rovetta, S.   +11 more
core   +1 more source

Genetic dissection of human ABCE1 in yeast reveals separable requirements for ribosome recycling and suppression of aberrant reinitiation

FEBS Open Bio, EarlyView.
Human ABCE1 cannot functionally replace its yeast ortholog. Yeast–human chimera analysis identified NBD1 as a major interspecies barrier. Genetic screening yielded hABCE1 revertants that rescue yeast viability but fail to suppress aberrant translation reinitiation in the 3′ UTR.
Eriko Nakata, Yuxin Li, Kei Endo, Koichi Ito   +3 more
wiley   +1 more source

Partitioned Probe Comparability Graphs

Theoretical Computer Science, 2006
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
David B. Chandler, Maw-Shang Chang, Ton Kloks, Jiping Liu, Sheng-Lung Peng   +4 more
openaire   +2 more sources

Posterior Cortical Atrophy in the Asia‐Pacific: A Report From the PCA Asian Workgroup

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Posterior Cortical Atrophy (PCA) is a distinct dementia syndrome primarily affecting spatial abilities and visual processing. It is associated with degeneration in the posterior part of the brain. PCA is subclassified into PCA‐pure and PCA‐plus syndromes based on consensus criteria.
Yuttachai Likitjaroen, Ya‐Ting Chang, Levinia Lim, Pai‐Yi Chiu, Jung‐Lung Hsu, SangYun Kim, Wataru Narita, Na Young Ryoo, Kyoko Suzuki, Nagaendran Kandiah, Sebastian Crutch, Ming‐Chyi Pai   +11 more
wiley   +1 more source

Graph partitioning MapReduce-based algorithms for counting triangles in large-scale graphs. [PDF]

Sci Rep, 2023
Sharafeldeen A, Alrahmawy M, Elmougy S.
europepmc   +1 more source

Graph Partitioning with Natural Cuts

2011 IEEE International Parallel & Distributed Processing Symposium, 2011
We present a novel approach to graph partitioning based on the notion of \emph{natural cuts}. Our algorithm, called PUNCH, has two phases. The first phase performs a series of minimum-cut computations to identify and contract dense regions of the graph. This reduces the graph size, but preserves its general structure.
Delling, D., Goldberg, A. V., Razenshteyn, I., Werneck, R. F.   +3 more
openaire   +4 more sources

Partitioning a call graph [PDF]

, 2005
Splitting a large software system into smaller and more manageable units has become an important problem for many organizations. The basic structure of a software system is given by a directed graph with vertices representing the programs of the system ...
Pendavingh, Rudi, Verhoeven, Arie, Bisseling, Rob H., Cerav-Erbas, Selin, Reeves, Colin, Matthias Röger, Colin Reeves, Selin Cerav-erbas, Gvozdenovíc, Nebojša, Mathias Lorenz, Rob H. Bisseling, Byrka, Jarosław, Röger, Matthias, Arie Verhoeven, Lorenz, Mathias, Rudi Pendavingh   +15 more
core  

Plasma EV Proteomics Identifies ECM Remodeling and Inflammatory Proteins LUM and C7 as Candidate Biomarkers in FSHD

Annals of Clinical and Translational Neurology, EarlyView.
ABSTRACT Objective Facioscapulohumeral muscular dystrophy (FSHD) is one of the most debilitating and common muscular dystrophies. Despite its severity, no approved therapy exists for FSHD patients. However, several therapeutic candidates are currently under development, and some have recently entered clinical trials, marking the need for reliable ...
Mustafa Bilal Bayazit, Chiranth K. Nagaraj, Jackson S. Newell, Kim Truc Nguyen, Xilal Y. Rima, Jacob Doon‐Ralls, Eduardo Reátegui, Jeffrey M. Statland, Rabi Tawil, Kevin M. Flanigan, Scott Q. Harper, Nizar Y. Saad   +11 more
wiley   +1 more source

Speeding Up Reachability Queries in Public Transport Networks Using Graph Partitioning. [PDF]

Inf Syst Front, 2022
Tesfaye B, Augsten N, Pawlik M, Böhlen MH, Jensen CS.   +4 more
europepmc   +1 more source

Matrix partitions of split graphs

Discrete Applied Mathematics, 2014
Matrix partition problems generalize a number of natural graph partition problems, and have been studied for several standard graph classes. We prove that each matrix partition problem has only finitely many minimal obstructions for split graphs. Previously such a result was only known for the class of cographs.
Tomás Feder, Pavol Hell, Oren Shklarsky
openaire   +2 more sources