Results 81 to 90 of about 36,227 (305)
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
Improving quality of graph partitioning using multilevel optimization
Graph partitioning is required for solving tasks on graphs that need to be split across disks or computers. This problem is well studied, but most results are not suitable for processing graphs with billons of nodes on commodity clusters, since they ...
R. Pastukhov +3 more
doaj +1 more source
Polyhedral Computations for the Simple Graph Partitioning Problem [PDF]
The simple graph partitioning problem is to partition an edge-weighted graph into mutually disjoint subgraphs, each containing no more than b nodes, such that the sum of the weights of all edges in the subgraphs is maximal.
Sørensen, Michael M.
core
Dynamic graph partitioning in streaming manner
This dissertation addresses the problem of dynamic graph partitioning in a streaming manner in the cloud. This problem applies to real-world graph applications such as PageRank, Social Networks, Shortest Path and so on.
Patwary, MAK (15721850)
core +1 more source
YIPFα1A expression is regulated by multilayered molecular mechanisms
YIPFα1A, a five‐pass Golgi protein, is regulated at multiple layers. (1) Rare‐codon enrichment drives translation‐coupled mRNA decay. (2) A proximal 3′‐UTR element stabilizes mRNA. (3) A distal 3′‐UTR element included by alternate poly(A) site usage represses translation, which can be overridden by the proximal 3′‐UTR element.
Tokio Takaji +2 more
wiley +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
Network partitioning techniques based on network natural properties for power system application
This thesis was submitted for the degree of Doctor of Philosophy and awarded by Brunel University, 10/04/2002.In this thesis, the problem of partitioning a network into interconnected sub-networks is addressed. The goal is to achieve a partitioning which
Alkhelaiwi, Ali Mani Turki
core
Multicriteria graph partitioning
The thesis is about graph partitioning and applications of graph partitioning in paral- lel algorithms for solving big sparse linear equations. The problem of graph partitioning is thorougly described and standard graph partitioning algorithms are ...
Houška, Ondřej
core
On partitions of graphs into trees
AbstractWe consider the minimum number ⊤(G) of subsets into which the edge set E(G) of a graph G can be partitioned so that each subset forms a tree. It is shown that for any connected G with n vertices, we always have τ(G)⩽⌈12n⌉.
openaire +1 more source
On the k-partition dimension of graphs [PDF]
19 pages, 3 ...
openaire +5 more sources

