The DNA segment essential for plasmid replication commonly is referred to as the core or minimal replicon. We report here that host and plasmid genes and sites external to the core replicon of plasmid pSC101 determine the boundaries and competence of the replicon and also the efficiency of partitioning. Missense mutations in the plasmid-encoded RepA protein or mutation of the Escherichia coli t...

BACKGROUND Precise diagnosis of disease risk factors via efficient statistical models is the primary step for reducing the heavy costs of breast cancer, as one of the most highly prevalent cancer throughout the world. Therefore, the aim of this study was to present a recently introduced statistical model in order to assess its proficiency for model fitting. METHODS The information of 1465 eli...

This paper focuses on domain decomposition-based numerical simulations whose subproblems corresponding to the various subdomains are solved using sparse direct factorization methods (e.g., FETI). Effective load-balancing of such computations requires that the resulting partitioning simultaneously balances the amount of time required to factor the local subproblem using direct factorization, and...

Ecological isolation through resource partitioning is invoked as a major factor for explaining the persistence of genetically distinct yet closely related sympatric populations. Two genetically distinct sympatric populations of anadromous rainbow smelt (Osmerus mordax) exist in the middle estuary of the St. Lawrence River. The persistence of these coexisting populations in sympatry is in confli...

Multiscale community detection can be viewed from a dynamical perspective within the Markov Stability framework, which uses the diffusion of a Markov process on the graph to uncover intrinsic network substructures across all scales. Here we reformulate multiscale community detection as a max-sum length vector partitioning problem with respect to the set of time-dependent node vectors expressed ...

There are many domains in which it would be very useful if we could take a monolithic program and automatically convert it into a distributed program according to some partitioning objective, such as minimizing total execution time or minimizing energy consumption on one particular distribution node. We present two novel techniques that work together to provide automatic multi-objective partiti...

Stream processing has become the dominant processing model for monitoring and real-time analytics. Modern Parallel Stream Processing Engines (pSPEs) have made it feasible to increase the performance in both monitoring and analytical queries by parallelizing a query’s execution and distributing the load on multiple workers. A determining factor for the performance of a pSPE is the partitioning a...

Stability aspects of recursive partitioning procedures are investi gated Using resampling techniques diagnostic tools to assess single split stability and overall tree stability are introduced To correct for the procedure s preference for covariates with many unique realiza tions corrected p values are used in the factor selection component of the algorithm Finally methods to stabilize tree bas...

To understand the physics of polymer equilibrium and dynamics in the confines of ion channel pores, we study partitioning of poly(ethylene glycol)s (PEGs) of different molecular weights into the bacterial porin, OmpF. Thermodynamic and kinetic parameters of partitioning are deduced from the effects of polymer addition on ion currents through single OmpF channels reconstituted into planar lipid ...

A special case of an elegant result due to Anderson proves that the number of (s, s + 1)-core partitions is finite and is given by the Catalan number Cs. Amdeberhan recently conjectured that the number of (s, s + 1)-core partitions into distinct parts equals the Fibonacci number Fs+1. We prove this conjecture by enumerating, more generally, (s, ds− 1)-core partitions into distinct parts. We do ...