Results 81 to 90 of about 5,697,479 (365)

Fast Combinatorial Algorithms for Efficient Sortation [PDF]

open access: green, 2023
Madison Van Dyk   +3 more
openalex   +1 more source

Automated FRAP microscopy for high‐throughput analysis of protein dynamics in chromatin organization and transcription

open access: yesFEBS Open Bio, EarlyView.
RoboMic is an automated confocal microscopy pipeline for high‐throughput functional imaging in living cells. Demonstrated with fluorescence recovery after photobleaching (FRAP), it integrates AI‐driven nuclear segmentation, ROI selection, bleaching, and analysis.
Selçuk Yavuz   +6 more
wiley   +1 more source

An In-Place Sorting with O(n log n) Comparisons and O(n) Moves

open access: yes, 2003
We present the first in-place algorithm for sorting an array of size n that performs, in the worst case, at most O(n log n) element comparisons and O(n) element transports.
Franceschini, Gianni, Geffert, Viliam
core   +2 more sources

Enzymatic degradation of biopolymers in amorphous and molten states: mechanisms and applications

open access: yesFEBS Open Bio, EarlyView.
This review explains how polymer morphology and thermal state shape enzymatic degradation pathways, comparing amorphous and molten biopolymer structures. By integrating structure–reactivity principles with insights from thermodynamics and enzyme engineering, it highlights mechanisms that enable efficient polymer breakdown.
Anđela Pustak, Aleksandra Maršavelski
wiley   +1 more source

Deriving Sorting Algorithms

open access: yes, 2008
Comment: Technical ...
Almeida, José Bacelar   +1 more
openaire   +3 more sources

Parallel construction of binary tree based on sorting

open access: yesAdvanced Engineering Research, 2018
Introduction. Algorithms for the parallel binary tree construction are developed. The algorithms are based on sorting and described in a constructive form. For the Nelement set, the time complexity has T(R) = O(1) and T(R) = O(log2 N) estimates, where R =
Ya. E. Romm, D. A. Chabanyuk
doaj   +1 more source

Just Sort It! A Simple and Effective Approach to Active Preference Learning [PDF]

open access: yes, 2017
We address the problem of learning a ranking by using adaptively chosen pairwise comparisons. Our goal is to recover the ranking accurately but to sample the comparisons sparingly.
Grossglauser, Matthias, Maystre, Lucas
core   +1 more source

Tumor‐stromal crosstalk and macrophage enrichment are associated with chemotherapy response in bladder cancer

open access: yesFEBS Open Bio, EarlyView.
Chemoresistance in bladder cancer: Macrophage recruitment associated with CXCL1, CXCL5 and CXCL8 expression is characteristic of Gemcitabine/Cisplatin (Gem/Cis) Non‐Responder tumors (right side) while Responder tumors did not show substantial tumor‐stromal crosstalk (left side). All biological icons are attributed to Bioicons: carcinoma, cancerous‐cell‐
Sophie Leypold   +11 more
wiley   +1 more source

SA Sorting: A Novel Sorting Technique for Large-Scale Data

open access: yesJournal of Computer Networks and Communications, 2019
Sorting is one of the operations on data structures used in a special situation. Sorting is defined as an arrangement of data or records in a particular logical order. A number of algorithms are developed for sorting the data.
Mohammad Shabaz, Ashok Kumar
doaj   +1 more source

The Use of Algorithmic Skeletons to Design Actor-Based Parallel Algorithms

open access: yesСовременные информационные технологии и IT-образование, 2020
The paper proposes a method for writing parallel algorithms. Our goal was to make a detailed description of concurrency while carrying no dependencies in programming language or underlying parallel architecture.
Sergey Vostokin, Irina Bobyleva
doaj   +1 more source

Home - About - Disclaimer - Privacy