Directed replacement

L Karttunen - arXiv preprint cmp-lg/9606029, 1996 - arxiv.org
… of directed replace operators. In contrast to the simple replace expression, UPPER -> LOWER,
defined in Karttunen (1995), the new directed … longest possible replacement at each point. …

An image-directed robotic system for hip replacement surgery

RH Taylor, HA Paul, BD Mittelstadt… - Journal of the Robotics …, 1990 - jstage.jst.go.jp
… We have developed an image-directed … total hip replacement … For example, about
half of the 300,000 total hip replacement operations performed each year use cementless implants, …

Replacement paths and k simple shortest paths in unweighted directed graphs

L Roditty, U Zwick - ACM Transactions on Algorithms (TALG), 2012 - dl.acm.org
… an algorithm for solving the replacement paths problem for unweighted directed graphs and
directed graphs with small integer weights. Let G = (V, E) be a directed graph and let s and t …

Near optimal algorithm for the directed single source replacement paths problem

S Chechik, O Magen - arXiv preprint arXiv:2004.13673, 2020 - arxiv.org
… algorithm for unweighted directed graphs 1. Previously such a bound was known in the
directed case only for the seemingly easier problem of replacement path where both the source …

[HTML][HTML] … -directed rehabilitation exercises in the outpatient or home setting improve strength, gait speed and cadence after elective total hip replacement: a systematic …

CL Coulter, JM Scarvell, TM Neeman, PN Smith - Journal of physiotherapy, 2013 - Elsevier
Question In people who have been discharged from hospital after a total hip replacement,
do rehabilitation exercises directed by a physiotherapist improve strength, gait, function and …

A near-linear-time algorithm for computing replacement paths in planar directed graphs

Y Emek, D Peleg, L Roditty - ACM Transactions on Algorithms (TALG), 2010 - dl.acm.org
… In this article we present an algorithm that solves the replacement paths problem on weighted
planar directed graphs in O(n log3 n) time2 compared to the O(n2 logn) time of the state-of-…

CRISPR-Directed Gene Editing Catalyzes Precise Gene Segment Replacement In Vitro Enabling a Novel Method for Multiplex Site-Directed Mutagenesis

BM Sansbury, AM Wagner, G Tarcic, S Barth… - The CRISPR …, 2019 - liebertpub.com
… We demonstrate efficient and precise donor DNA fragment replacement accompanied by a
… -directed gene editing in mammalian cells. We were able to achieve precise replacement

Replacement Paths and k Simple Shortest Paths in Unweighted Directed Graphs

L Roditty, U Zwick - International Colloquium on Automata, Languages …, 2005 - Springer
… Let G = (V,E) be a directed graph and let P be a shortest path from s to t in G. In the replacement
… -trivial algorithm for computing replacement paths in unweighted directed graphs (and in …

Solving the Replacement Paths Problem for Planar Directed Graphs in O(n log n) Time

C Wulff-Nilsen - Proceedings of the twenty-first annual ACM-SIAM …, 2010 - SIAM
… as the replacement paths problem. We give a linearspace algorithm with O(n log n) running
time for n-vertex planar directed graphs. The … The directed case is harder since it has an Ω(m …

Minireview: β-cell replacement therapy for diabetes in the 21st century: manipulation of cell fate by directed differentiation

V Yechoor, L Chan - Molecular endocrinology, 2010 - academic.oup.com
Pancreatic β-cell failure underlies type 1 diabetes; it also contributes in an essential way to
type 2 diabetes. β-Cell replacement is an important component of any cure for diabetes. The …