Results 81 to 90 of about 832,082 (275)
Algorithms for finding the minimum cycle mean in the weighted directed graph [PDF]
In this paper we study the problem of finding the minimum cycle mean in the weighted directed graph. The computational aspect of some algorithms for solving this problem is discussed and two algorithms for minimum cycle mean finding in the weighted ...
D. Lozovanu, C. Petic
doaj
Metformin mediates mitochondrial quality control in Leber's hereditary optic neuropathy (LHON) fibroblasts carrying mtDNA mutations. At therapeutic levels, metformin activates AMPK signaling to restore mitochondrial dynamics by promoting fusion and restraining fission, while preserving mitochondrial mass, enhancing autophagy/mitophagy and biogenesis ...
Chatnapa Panusatid +3 more
wiley +1 more source
Determinantal properties of Boolean graphs using recursive approach
The aim of this paper is to study the determinant and inverse of the adjacency matrices of weighted and directed versions of Boolean graphs. Our approach is recursive. We describe the adjacency matrix of a weighted Boolean graph in terms of the adjacency
Gahininath Sonawane +2 more
doaj +1 more source
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
Mouse pre‐implantation development involves a transition from totipotency to pluripotency. Integrating transcriptomics, epigenetic profiling, low‐input proteomics and functional assays, we show that eight‐cell embryos retain residual totipotency features, whereas cytoskeletal remodeling regulated by the ubiquitin‐proteasome system drives progression ...
Wanqiong Li +8 more
wiley +1 more source
Measuring the complexity of directed graphs: A polynomial-based approach.
In this paper, we define novel graph measures for directed networks. The measures are based on graph polynomials utilizing the out- and in-degrees of directed graphs. Based on these polynomial, we define another polynomial and use their positive zeros as
Matthias Dehmer +8 more
doaj +1 more source
The storage capacity of a directed graph and nodewise autonomous, ubiquitous learning. [PDF]
Wei H, Li F.
europepmc +1 more source
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
In this article, Temperley's bijection between spanning trees of the square grid on the one hand, and perfect matchings (also known as dimer coverings) of the square grid on the other, is extended to the setting of general planar directed (and undirected)
Kenyon, Richard W. +2 more
core +2 more sources
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
We describe an optimised single‐molecule DNA flow‐stretch assay that visualises DNA–protein interactions in real time. Linear DNA fragments are tethered to a surface and stretched by buffer flow for fluorescence imaging. Using λ and φX174 DNA, this protocol enhances reproducibility and accessibility, providing a versatile approach for studying diverse ...
Ayush Kumar Ganguli +8 more
wiley +1 more source

