Results 81 to 90 of about 892,017 (284)

Exact Algorithms for Kayles [PDF]

open access: yes, 2011
In the game of Kayles, two players select alternatingly a vertex from a given graph G, but may never choose a vertex that is adjacent or equal to an already chosen vertex. The last player that can select a vertex wins the game. In this paper, we give an exact algorithm to determine which player has a winning strategy in this game.
Bodlaender, H.L., Kratsch, D.
openaire   +2 more sources

Exact algorithms via monotone local search [PDF]

open access: yesProceedings of the forty-eighth annual ACM symposium on Theory of Computing, 2016
We give a new general approach for designing exact exponential-time algorithms for subset problems . In a subset problem the input implicitly describes a family of sets over a universe of size n and the task is to determine whether the family contains at least one set.
Fedor V. Fomin   +3 more
openaire   +3 more sources

PARALLEL QUICK SEARCH ALGORITHM TO SPEED PACKET PAYLOAD FILTERING IN NIDS [PDF]

open access: yesJournal of Engineering Science and Technology, 2009
An Intrusion Detection System (IDS) is a system to detect intruders who try to hack in to the network and steal information and report them to the network administrator. There are many tools used in this field, snort consider one of the most tools mostly
ADNAN A. HNAIF   +4 more
doaj  

Multi‐omics and low‐input proteomics profiling reveals dynamic regulation driving pluripotency initiation in early mouse embryos

open access: yesFEBS Open Bio, EarlyView.
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

Strongly Polynomial Primal-Dual Algorithms for Concave Cost Combinatorial Optimization Problems [PDF]

open access: yes, 2012
We introduce an algorithm design technique for a class of combinatorial optimization problems with concave costs. This technique yields a strongly polynomial primal-dual algorithm for a concave cost problem whenever such an algorithm exists for the fixed-
Magnanti, Thomas L., Stratila, Dan
core   +2 more sources

BMI‐1 modulation and trafficking during M phase in diffuse intrinsic pontine glioma

open access: yesFEBS Open Bio, EarlyView.
The schematic illustrates BMI‐1 phosphorylation during M phase, which triggers its translocation from the nucleus to the cytoplasm. In cycling cells, BMI‐1 functions within the PRC1 complex to mediate H2A K119 monoubiquitination. Following PTC596‐induced M phase arrest, phosphorylated BMI‐1 dissociates from PRC1 and is exported to the cytoplasm via its
Banlanjo Umaru   +6 more
wiley   +1 more source

Applicability of mitotic figure counting by deep learning: a development and pan‐cancer validation study

open access: yesFEBS Open Bio, EarlyView.
In this study, we developed a deep learning method for mitotic figure counting in H&E‐stained whole‐slide images and evaluated its prognostic impact in 13 external validation cohorts from seven different cancer types. Patients with more mitotic figures per mm2 had significantly worse patient outcome in all the studied cancer types except colorectal ...
Joakim Kalsnes   +32 more
wiley   +1 more source

Asymptotically exact streaming algorithms

open access: yes, 2014
We introduce a new computational model for data streams: asymptotically exact streaming algorithms. These algorithms have an approximation ratio that tends to one as the length of the stream goes to infinity while the memory used by the algorithm is restricted to polylog(n) size. Thus, the output of the algorithm is optimal in the limit.
Heinrich, Marc   +2 more
openaire   +2 more sources

Single‐molecule DNA flow‐stretch assays for high‐throughput DNA–protein interaction studies

open access: yesFEBS 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

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

open access: yesFEBS 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   +4 more
wiley   +1 more source

Home - About - Disclaimer - Privacy