Impairment of replication fork progression is a serious threat to living organisms and a potential source of genome instability. Studies in prokaryotes have provided evidence that inactivated replication forks can restart by the reassembly of the replication machinery. Several strategies for the processing of inactivated replication forks before replisome reassembly have been described. Most of...

Stalled replication forks are sources of genetic instability. Multiple fork-remodeling enzymes are recruited to stalled forks, but how they work to promote fork restart is poorly understood. By combining ensemble biochemical assays and single-molecule studies with magnetic tweezers, we show that SMARCAL1 branch migration and DNA-annealing activities are directed by the single-stranded DNA-bindi...

A repair protein like RecG moves the stalled replication fork in the direction from the zipped to the unzipped state of DNA. It is proposed here that a softening of the zipped-unzipped interface at the fork results in the front propagating towards the unzipped side. In this scenario, an ordinary helicase destabilizes the zipped state locally near the interface and the fork propagates towards th...

We used DNA microarrays of the Escherichia coli genome to trace the progression of chromosomal replication forks in synchronized cells. We found that both DNA gyrase and topoisomerase IV (topo IV) promote replication fork progression. When both enzymes were inhibited, the replication fork stopped rapidly. The elongation rate with topo IV alone was 1/3 of normal. Genetic data confirmed and exten...

We describe a method for implementing a remote fork , a primitive with the semantics of a UNIX fork() call which begins the execution of the child process on a remote machine. We begin by examining the subject of process migration, and conclude that most of the relevant process state can be captured and transferred to a remote system without operating system support. We then show how our implem...

.-\.0. iterative approximation algorithm for analyzing a closed queueing system with a K-sibling fork/ join queue is presented. The iterative procedure is based on a combination of nearly complete decomposability and the Gauss-Seidel method. The approximation procedure gives good results for the mean response time and the system throughput. However, it gives results which are an upper bound of ...

System testing is an essential part of software development. Unfortunately, comprehensive testing of large systems is often resource intensive and time-consuming. In this paper, we explore the possibility of leveraging hierarchical virtual machine (VM) fork to optimize system testing in the cloud. Testing using VM fork has the potential to save system configuration effort, obviate the need to r...

We investigate an open question concerning properties of algebraic independence in continuous theories (see Section 4). The rest of the work is essentially a translation to continuous logic of popular notions of independence (in particular, forking and dividing). Much of the time we are simply “copying” classical proofs from well-known sources, while along the way making the necessary adjustmen...