Results 41 to 50 of about 270,354 (261)
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
NEW ALGORITHM FOR SOLUTION OF MAXIMUM FLOW PROBLEM
Наука и техника, 2013 A new algorithm for detection of a maximum flow in multi-terminal network. The algorithm is based on its matrices description and execution of ternary operations in respect of matrix elements pertaining to arc capacity.
A. D. Korznikov
doaj
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2016 This paper extends the maximum flow-covering location and service start time problem (MFCLSTP) by additionally imposing a minimum stay at a facility before the service can be used.
Ken-ichi TANAKA, Shigeki TORIUMI
doaj +1 more source
A DNA Algorithm for Calculating the Maximum Flow of a Network
Foundations of Computing and Decision Sciences, 2023 DNA computing is a highly interdisciplinary field which combines molecular operations with theoretical algorithm design. A number of algorithms have been demonstrated in DNA computing, but to date network flow problems have not been studied.
Sackmann Andrea +6 more
doaj +1 more source
Protocol for quantifying miRNA trafficking across the endosomal membrane
FEBS Open Bio, EarlyView.An in vitro protocol measures miRNA uptake into endosomes isolated from mammalian cell extracts, which are free of subcellular contaminants. Performed at 37 °C in the presence of ATP, it ensures the import of single‐stranded miRNA into the endosomal lumen.
Syamantak Ghosh +2 more
wiley +1 more source
The maximum flow in dynamic networks [PDF]
Computer Science Journal of Moldova, 2005 The dynamic maximum flow problem that generalizes the static maximum flow problem is formulated and studied. We consider the problem on a network with capacities depending on time, fixed transit times on the arcs, and a given time horizon.
Maria A. Fonoberova, Dmitrii D. Lozovanu
doaj
New Directions for Adult and Continuing Education, EarlyView.ABSTRACT Advancing artificial intelligence (AI) has transformed learning and work, yet higher education and professional development programs have not systematically equipped learners for AI‐prevalent environments. This lack of preparation creates uncertainty regarding control, responsibility, trust, and accountability.
Moon‐Heum Cho, Jerusalem Merkebu
wiley +1 more source
A bit-arc capacity scaling algorithm for the maximum flow problem subjected to box constraints on the flow vector in digraph [PDF]
Network BiologyA bit-arc capacity scaling algorithm to solve the maximal flow problem subjected to box constraints on the flow vector in directed network has been presented. The algorithm is mainly based on successive divisions of capacities by multiples of two.
Muhammad Tlas
doaj
Maximum Weight Scheduling Algorithm for Wireless Network Based on Congestion Control [PDF]
Jisuanji gongcheng, 2016 In wireless network,packet scheduling and congestion control are usually independently designed.This prevents the network resources from being efficiently utilized.In order to solve this problem,a new maximum weight scheduling algorithm based on ...
CHEN Chixin,ZHOU Jipeng
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Background Cognitive impairment is a common non‐motor symptom in Multiple Sclerosis (MS), negatively affecting autonomy and Quality of Life (QoL). Innovative rehabilitation strategies, such as semi‐immersive virtual reality (VR) and computerized cognitive training (CCT), may offer advantages over traditional cognitive rehabilitation (TCR ...
Maria Grazia Maggio +8 more
wiley +1 more source