Results 71 to 80 of about 2,824,860 (307)
Fast edge colorings with fixed number of colors to minimize imbalance
Journal of Graph Algorithms and Applications, 2008 We study the following optimization problem: the input is a multigraph G=(V,E) and an integer parameter g. A feasible solution consists of a (not necessarily proper) coloring of E with colors 1, 2, …, g.
Gruia Calinescu, Michael Pelsmajer
doaj +1 more source
An introduction to randomized algorithms
Discrete Applied Mathematics, 1991 The concept of randomization is known to be an extremely important tool for the design of algorithms. Its use often yields better time or space complexity compared with the best deterministic algorithms we know of for the same problem; moreover resulting randomized algorithms are often very simple to understand and implement.
openaire +2 more sources
Ligand‐dependent transcriptional heterogeneity in cell cycle gene expression delays G1/S entry
FEBS Letters, EarlyView.EGF and HRG induce distinct G1/S progression programs in ErbB2‐amplified BT474 breast cancer cells. Despite activating the potent ErbB2–ErbB3 heterodimer, HRG does not accelerate cell‐cycle entry. Instead, EGF promotes earlier restriction‐point passage via ERK–FOS signaling, whereas HRG activates the AKT–MYC axis, driving transcriptional heterogeneity ...
Ririn Rahmala Febri +5 more
wiley +1 more source
Randomized Sliding Window Algorithms for Regular Languages [PDF]
, 2018 A sliding window algorithm receives a stream of symbols and has to output at each time instant a certain value which only depends on the last n symbols.
Hucke, Danny +2 more
core +1 more source
Notes on Randomized Algorithms [PDF]
Lecture notes for the Yale Computer Science course CPSC 469/569 Randomized Algorithms. Suitable for use as a supplementary text for an introductory graduate or advanced undergraduate course on randomized algorithms.
Aspnes, James
core +1 more source
A Monad for Randomized Algorithms
Electronic Notes in Theoretical Computer Science, 2016 AbstractIn this paper, we introduce a monad of random choice for domains that does not suffer from the main two drawbacks of the probabilistic powerdomain. It is not known whether any Cartesian closed category of domains is closed under the probabilistic powerdomain, but the Cartesian closed category BCD is closed under this monad of random choice ...
openaire +1 more source
Kolmogorov Complexity and Algorithmic Randomness [PDF]
, 2017 A monograph on Kolmogorov complexity and algorithmic randomness. The first part is a kind of a textbook that covers basic notions and results; the second part is an exposition of some work done around the Kolmogorov seminar and later ANR NAFIT ...
Shen, Alexander +2 more
openaire +3 more sources
A randomized maximum-flow algorithm [PDF]
30th Annual Symposium on Foundations of Computer Science, 1989 A randomized algorithm for computing a maximum flow is presented. For an n-vertex m-edge network, the running time is $O(nm + n^{2}(\log n)^{2})$ with probability at least $1-2^{-\sqrt {nm}}$. The algorithm is always correct, and in the worst case runs in $O(nm \log n)$ time.
Cheriyan, J., Hagerup, T.
openaire +4 more sources
The Shewanella oneidensis Fic enzyme SoFic targets the switch‐I region of EF‐Tu for AMPylation
FEBS Letters, EarlyView.Fic enzymes mediate diverse post‐translational modifications across all domains of life, including AMPylation. Prokaryotic EF‐Tu can be AMPylated and deAMPylated by the conserved Fic enzyme SoFic. Structural and biochemical approaches were used to characterize the effect of AMPylation on EF‐Tu, SoFic's enzymatic activities, and the enzyme‐target ...
Svenja Runge +6 more
wiley +1 more source
Molecular Oncology, EarlyView.This study integrates publicly available transcriptomic datasets to identify molecular signatures associated with response to neoadjuvant chemoradiotherapy in locally advanced rectal cancer. By analyzing a combination of multiple cohorts with bioinformatics approaches, we reveal biological pathways and immune‐related features that may improve ...
Aleksandra Stanojevic +10 more
wiley +1 more source