Results 81 to 90 of about 197,409 (310)
Beyond pairwise clustering [PDF]
We consider the problem of clustering in domains where the affinity relations are not dyadic (pairwise), but rather triadic, tetradic or higher. The problem is an instance of the hypergraph partitioning problem.
Agarwal, Sameer +5 more
core +2 more sources
dUTPases are involved in balancing the appropriate nucleotide pools. We showed that dUTPase is essential for normal development in zebrafish. The different zebrafish genomes contain several single‐nucleotide variations (SNPs) of the dut gene. One of the dUTPase variants displayed drastically lower protein stability and catalytic efficiency as compared ...
Viktória Perey‐Simon +6 more
wiley +1 more source
Partitioning technique for a discrete quantum system
We develop the partitioning technique for quantum discrete systems. The graph consists of several subgraphs: a central graph and several branch graphs, with each branch graph being rooted by an individual node on the central one.
I. Hubač +5 more
core +1 more source
Decreased Serum 5‐HT: Clinical Correlates and Regulatory Role in NMJ of MG
ABSTRACT Objective Although 5‐Hydroxytryptamine (5‐HT) indirectly stimulates muscle contraction and participates in regulating Acetylcholine receptor (AChR) cluster homeostasis in cellular, animal, and clinical studies, evidence regarding its potential to modulate muscle contraction in myasthenia gravis (MG) remains limited.
Xinru Shen +18 more
wiley +1 more source
The author considers two kinds of graphs whose vertices are partial partitions. Let A be a set. A family \(\{A_ i\}_{i\in I}\), \(A_ i\subset A\), is called a partial partition of A (or p-partition) if \(A_ i\cap A_ j=\emptyset\) for any i,j\(\in I\), \(i\neq j\). It is studied the so-called intersection graph of p-partitions of a given set A, i.e.
openaire +2 more sources
Higher Amyloid and Tau Burden Is Associated With Faster Decline on a Digital Cognitive Test
ABSTRACT Objective A 2‐min digital clock‐drawing test (DCTclock) captures more granular features of the clock‐drawing process than the pencil‐and‐paper clock‐drawing test, revealing more subtle deficits at the preclinical stage of Alzheimer's disease (AD). A previous cross‐sectional study demonstrated that worse DCTclock performance was associated with
Jessie Fanglu Fu +16 more
wiley +1 more source
Some NP-complete edge packing and partitioning problems in planar graphs [PDF]
Graph packing and partitioning problems have been studied in many contexts, including from the algorithmic complexity perspective. Consider the packing problem of determining whether a graph contains a spanning tree and a cycle that do not share edges ...
Yang, Jed
core
Loom: Query-aware Partitioning of Online Graphs
As with general graph processing systems, partitioning data over a cluster of machines improves the scalability of graph database management systems. However, these systems will incur additional network cost during the execution of a query workload, due ...
Aiston, Jack +2 more
core +1 more source
Frailty Exacerbates Disability in Progressive Multiple Sclerosis
ABSTRACT Background To evaluate frailty in severe progressive multiple sclerosis (PMS) and to investigate the underlying mechanisms. Methods This prospective, cross‐sectional, multicenter study enrolled a late severe PMS group requiring skilled nursing (n = 53) and an age, sex, and disease duration‐matched control PMS group (n = 53).
Taylor R. Wicks +10 more
wiley +1 more source
Experimental Validation of Graph Theory-Based Leak Detection Algorithm
In this paper, we present results from a study on leak detection based on graph partitioning. Leaks are isolated using graph partitioning and performing mass balances over the partitions.
Lisa Saboo +4 more
doaj +1 more source

