Results 51 to 60 of about 114,308 (265)

Association Between Individualized Education for Kidney Replacement Therapy Modality Selection and Peritoneal Dialysis Initiation: A Cross‐Sectional Study

Therapeutic Apheresis and Dialysis, EarlyView.
ABSTRACT Introduction Peritoneal dialysis (PD) is an established home‐based kidney replacement therapy (KRT), but its uptake remains low in Japan. We evaluated whether individualized education in a dedicated outpatient clinic was associated with the initiation of PD.
Yasuko Ito, Ryuichi Yoshimura, Takaki Yamauchi, Yuta Funakoshi, Hirotaka Sonoda, Seiji Kobayashi, Hiroyuki Terawaki, Takafumi Ito   +7 more
wiley   +1 more source

RANDOMIZED ALGORITHMS FOR MOTIF DETECTION [PDF]

Journal of Bioinformatics and Computational Biology, 2005
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g. locating binding sites regulatory signals, designing genetic probes etc. In this paper, we propose a randomized algorithm, design an improved EM algorithm and combine them to form a software tool. Results: (1) We design a randomized algorithm for
Lusheng Wang 0001, Liang Dong
openaire   +2 more sources

Salmonella lipopolysaccharide‐containing supported lipid bilayers as platforms to study bacteriophage interactions

FEBS Letters, EarlyView.
We present robust protocols for the preparation of supported lipid bilayers (SLBs) incorporating either Salmonella smooth LPS or outer membrane vesicles (OMVs). We use a combination of quartz crystal microbalance with dissipation (QCM‐D) and fluorescence microscopy to both characterize the SLBs of various compositions and to probe their interactions ...
Hudson P. Pace, Alyssa Borges, Charles Arnaud, Tove Karlsson, Nina K. Bröker, Stefanie Barbirz, Marta Bally   +6 more
wiley   +1 more source

A New Randomized Algorithm for Handling Scheduling Conflicts in Grids

Advances in Electrical and Computer Engineering, 2009
As the scale of Grid platforms grows, the idea of a centralized scheduler loses its efficiency, and it is replaced with the scheme of decentralized schedulers.
VAHDAT-NEJAD, H., ZAMANIFAR, K.
doaj   +1 more source

Probability-boosting technique for combinatorial optimization [PDF]

PeerJ Computer Science
In many combinatorial optimization problems we want a particular set of k out of n items with some certain properties (or constraints). These properties may involve the k items.
Sanpawat Kantabutra
doaj   +2 more sources

A Randomized Algorithm for 3-SAT [PDF]

Mathematics in Computer Science, 2010
In this work we propose and analyze a simple randomized algorithm to find a satisfiable assignment for a Boolean formula in conjunctive normal form (CNF) having at most 3 literals in every clause. Given a k-CNF formula phi on n variables, and alpha in{0,1}^n that satisfies phi, a clause of phi is critical if exactly one literal of that clause is ...
Subhas Kumar Ghosh, Janardan Misra
openaire   +2 more sources

Structural insights and therapeutic targets in Acinetobacter baumannii capsule biosynthesis

FEBS Letters, EarlyView.
Hypervirulent KL49 A. baumannii's capsular polysaccharide contains the nonulosonic acid 8‐epi‐Leg5,7Ac2, synthesized by epimerization via ElaA, ElaB, and ElaC. Crystal structures of ElaA, ElaB, and ElaC reveal their role in CMP‐Leg5,7Ac2 synthesis and regioselective C8 epimerization.
Woo Cheol Lee, Junho Jeong, Chae Yeong Lee, Hyunjoon Cho, Man Hwan Oh, Je Chul Lee, Jee‐Young Lee, Yangmee Kim   +7 more
wiley   +1 more source

Peripheral lysosomes recruit PLEKHG3 to focal adhesions and restrain protrusion dynamics

FEBS Letters, EarlyView.
Proximity‐dependent labeling at the LAMTOR complex revealed the Rho GEF PLEKHG3 as a lysosome‐proximal protein directing the study toward the influence of lysosome positioning on actin dynamics and cell motility. We show that PLEKHG3 colocalizes with lysosomes at focal adhesion sites and observe that forced peripheral dispersion of lysosomes hinders ...
Rainer Ettelt, Ana‐Maria Sandru, Georg Vucak, Sebastian Didusch, Biljana Riemelmoser, Karin Ehrenreiter, Markus Hartl, Lukas A. Huber, Manuela Baccarini   +8 more
wiley   +1 more source

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   +1 more source