Results 41 to 50 of about 218,626 (238)

Interpreting the effects of DNA polymerase variants at the structural level

Molecular Oncology, EarlyView.
Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi, Karolina Krzesińska, Ludovica Beltrame, Pablo Sánchez‐Izquierdo Besora, Matteo Tiberti, Mef Nilbert, Anna Rohlin, Elena Papaleo   +7 more
wiley   +1 more source

Improved Distributed Algorithms for Exact Shortest Paths

, 2018
Computing shortest paths is one of the central problems in the theory of distributed computing. For the last few years, substantial progress has been made on the approximate single source shortest paths problem, culminating in an algorithm of Becker et ...
A, Becker Ruben, Planar Distributed Algorithms, Weighted All-Pairs Shortest Distributed Exact   +3 more
core   +1 more source

Optimization of transport protocols with path-length constraints in complex networks [PDF]

, 2010
We propose a protocol optimization technique that is applicable to both weighted or unweighted graphs. Our aim is to explore by how much a small variation around the Shortest Path or Optimal Path protocols can enhance protocol performance.
Boettcher, Stefan, de la Lama, Marta S., Lopez, Eduardo, Ramasco, Jose J.   +3 more
core   +2 more sources

Raman‐based label‐free microscopic analysis of the pancreas in living zebrafish larvae

FEBS Open Bio, EarlyView.
Forward stimulated Raman scattering (F‐SRS) and epi coherent anti‐Stokes Raman scattering (E‐CARS) allow label‐free discrimination of distinct subcellular structures in the pancreas of living zebrafish larvae. Given the straightforward applicability, we anticipate broad implementation of Raman microscopy in other organs and across various biomedical ...
Noura Faraj, Eline M. F. de Lange, Klaas A. Sjollema, Ben N. G. Giepmans   +3 more
wiley   +1 more source

Polarization‐resolved femtosecond Vis/IR spectroscopy tailored for resolving weak signals in biological samples using minimal sample volume

FEBS Open Bio, EarlyView.
Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley   +1 more source

Maximum st-flow in directed planar graphs via shortest paths

, 2013
Minimum cuts have been closely related to shortest paths in planar graphs via planar duality - so long as the graphs are undirected. Even maximum flows are closely related to shortest paths for the same reason - so long as the source and the sink are on ...
C. Ford, D. Hochbaum, D. Sleator, G. Borradaile, G. Borradaile, R. Hassin, R. Tarjan   +6 more
core   +1 more source

The Discrepancy of Shortest Paths

CoRR
The hereditary discrepancy of a set system is a certain quantitative measure of the pseudorandom properties of the system. Roughly, hereditary discrepancy measures how well one can $2$-color the elements of the system so that each set contains approximately the same number of elements of each color.
Bodwin, Greg, Deng, Chengyuan, Gao, Jie, Hoppenworth, Gary, Upadhyay, Jalaj, Wang, Chen   +5 more
openaire   +4 more sources

Analysing the significance of small conformational changes and low occupancy states in serial crystallographic data

FEBS Open Bio, EarlyView.
This protocol paper outlines methods to establish the success of a time‐resolved serial crystallographic experiment, by means of statistical analysis of timepoint data in reciprocal space and models in real space. We show how to amplify the signal from excited states to visualise structural changes in successful experiments.
Jake Hill, Yelyzaveta Pulnova, Elke De Zitter, Helen M. Ginn, Briony A. Yorke   +4 more
wiley   +1 more source

Speeding up shortest path algorithms

, 2012
Given an arbitrary, non-negatively weighted, directed graph $G=(V,E)$ we present an algorithm that computes all pairs shortest paths in time $\mathcal{O}(m^* n + m \lg n + nT_\psi(m^*, n))$, where $m^*$ is the number of different edges contained in ...
A.V. Goldberg, C. Demetrescu, D. Karger, D.B. Johnson, E.W. Dijkstra, H.N. Gabow, M. Thorup, M.L. Fredman, S. Pettie, S. Pettie, T. Hagerup   +10 more
core   +1 more source

The complexity of rerouting shortest paths [PDF]

Theoretical Computer Science, 2012
The results on claw-free graphs, chordal graphs and isolated paths have been added in version 2 (april 2012). Version 1 (September 2010) only contained the PSPACE-hardness result. (Version 2 has been submitted.)
openaire   +2 more sources