Results 31 to 40 of about 88,447 (299)
Modelling stem cell differentiation related processes—A practical overview for biologists
FEBS Letters, EarlyView.Stem cell differentiation is complex and difficult to control experimentally. This review introduces suitable computational modelling approaches that can support stem cell research, from mechanistic ODE and abstract models to multiscale and deep learning methods.
Ricco Zeegelaar +4 more
wiley +1 more source
New algorithms for the dual of the convex cost network flow problem with application to computer vision [PDF]
, 2007 Motivated by various applications to computer vision, we consider an integer convex optimization problem which is the dual of the convex cost network flow problem.
Kolmogorov, V., Shioura, A.
core
Optimization of Multimodal Discrete Network Design Problems Based on Super Networks
Applied Sciences, 2021 In this paper, we investigate the multimodal discrete network design problem that simultaneously optimizes the car, bus, and rail transit network, in which inter-modal transfers are achieved by slow traffic modes including walking and bike-sharing ...
Yaling Zhou, Chengxuan Cao, Ziyan Feng
doaj +1 more source
Molecular Oncology, EarlyView.Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley +1 more source
A Faster Strongly Polynomial Minimum Cost Flow Algorithm [PDF]
, 1988 We present a new strongly polynomial algorithm for the minimum cost flow problem, based on a refinement of the Edmonds-Karp scaling technique. Our algorithm solves the uncapacitated minimum cost flow problem as a sequence of O(n log n) shortest path ...
James B. Orlin, James Orlin
core +1 more source
FEBS Open Bio, EarlyView.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
Minimum Link Flow Problem and Its Solution With Sparse Modeling
IEEE AccessRecently, a statistical modeling approach called sparse modeling has attracted much attention, especially in the fields of signal and image processing.
Ryotaro Matsuo +2 more
doaj +1 more source
Solving transportation problems with concave cost functions using genetic algorithms [PDF]
Computer Science Journal of Moldova, 2020 In this paper we propose a genetic algorithm for solving the non-linear transportation problem on a network with concave cost functions and the restriction that the flow must pass through all arcs of the network. We show that the algorithm can be used in
Tatiana Pasa
doaj
Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies
FEBS Open Bio, EarlyView.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
Capacity Inverse Minimum Cost Flow Problem [PDF]
, 2007 Given a directed graph G = (N,A) with arc capacities u and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacity vector u' for the arc set A such that a given feasible flow x' is optimal with ...
Hamacher, Horst, Güler, Cigdem
core