Results 41 to 50 of about 309,634 (292)
Linking and Cutting Spanning Trees [PDF]
Algorithms, 2018 We consider the problem of uniformly generating a spanning tree for an undirected connected graph. This process is useful for computing statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle graphs, we prove that this approach significantly outperforms existing algorithms.
Russo, Luís M. S. +2 more
openaire +4 more sources
Disordered but rhythmic—the role of intrinsic protein disorder in eukaryotic circadian timing
FEBS Letters, EarlyView.Unstructured domains known as intrinsically disordered regions (IDRs) are present in nearly every part of the eukaryotic core circadian oscillator. IDRs enable many diverse inter‐ and intramolecular interactions that support clock function. IDR conformations are highly tunable by post‐translational modifications and environmental conditions, which ...
Emery T. Usher, Jacqueline F. Pelham
wiley +1 more source
IEEE Access, 2020 This paper investigates the consensus of second-order multi-agent systems under switched topologies. Previous studies indicate that a consensus cannot be reached if the topology is fixed and has no spanning tree, but it is possible to reach a consensus ...
Dianhao Zheng +4 more
doaj +1 more source
On the Properties of Gromov Matrices and their Applications in Network Inference
, 2019 The spanning tree heuristic is a commonly adopted procedure in network inference and estimation. It allows one to generalize an inference method developed for trees, which is usually based on a statistically rigorous approach, to a heuristic procedure ...
Ji, Feng, Tang, Wenchang, Tay, Wee Peng
core +1 more source
FEBS Letters, EarlyView.Cryptochrome and PAS/LOV proteins play intricate roles in circadian clocks where they act as both sensors and mediators of protein–protein interactions. Their ubiquitous presence in signaling networks has positioned them as targets for small‐molecule therapeutics. This review provides a structural introduction to these protein families.
Eric D. Brinckman +2 more
wiley +1 more source
Optimasi Jaringan dengan Spanning Tree untuk Congestion Management
ComTech, 2014 A proper network optimization is needed to deal with problems on the network and to minimize latency in the data flow in a dense network. The data stream is directed into the right channels so that the optimal network speed and latency can be minimized.
Mayliana Mayliana
doaj +1 more source
Spanning Trees—Short or Small [PDF]
SIAM Journal on Discrete Mathematics, 1996 We study the problem of finding small trees. Classical network design problems are considered with the additional constraint that only a specified number $k$ of nodes are required to be connected in the solution. A prototypical example is the $k$MST problem in which we require a tree of minimum weight spanning at least $k$ nodes in an edge-weighted ...
Ravi, R. +4 more
openaire +2 more sources
Molecular Oncology, EarlyView.Development of therapies targeting cancer‐associated fibroblasts (CAFs) necessitates preclinical model systems that faithfully represent CAF–tumor biology. We established an in vitro coculture system of patient‐derived pancreatic CAFs and tumor cell lines and demonstrated its recapitulation of primary CAF–tumor biology with single‐cell transcriptomics ...
Elysia Saputra +10 more
wiley +1 more source
MEMBANGUN POHON MERENTANG MINIMUM DENGAN MENGGUNAKAN ALGORITMA PRIM [PDF]
, 2009 Graph is the method of discrete problem solution searching that was in the real world. Graph has much of concepts. The ones is Tree concept. Tree concept is being the significant and the popular concept because support to applies graph for a lot of ...
SUSIANI, ERNA
core
Spanning Trees in Random Satisfiability Problems
, 2006 Working with tree graphs is always easier than with loopy ones and spanning trees are the closest tree-like structures to a given graph. We find a correspondence between the solutions of random K-satisfiability problem and those of spanning trees in the ...
A Ramezanpour +6 more
core +1 more source