Stochastic simulations based on the tau leaping method are applicable to well stirred chemical reaction systems occurring inside a single fixed volume. In this paper we propose a novel method, based on the tau leaping procedure, for the simulation of complex systems composed by several communicating regions. The new method is here applied to dynamical probabilistic P systems, which are characte...

Highly accurate and reliable genotype calling is an essential component of any highthroughput SNP genotyping technology. BRLMM, the method of choice for the Mapping 500K product, is effective, but requires the presence of mismatched probes (MM) probes on the array to create “seed” genotypes. We present here a method that only uses perfect-match probes, BRLMM-P. The primary difference between BR...

Domain decomposition methods based on the Schwarz framework were originally proposed for the h-version nite element method for elliptic problems. In this paper, we consider instead the p-version, in which increased accuracy is achieved by increasing the degree of the elements while the mesh is xed. We consider linear, scalar, self adjoint, second order elliptic problems and quadrilateral elemen...

The determination of statistical significance in genetic linkage studies is complicated by many factors, such as missing individuals or uninformative markers, and the validity of theoretical results is often questionable. Although many simulation-based methods have been proposed to determine empirically the statistical significance, they are either not generally applicable to complex pedigree s...

We give a review of existing methods for solving the absolute and vertex restricted p-center problems on networks and propose a new integer programming formulation, a tightened version of this formulation and a new method based on successive restrictions of the new formulation. A specialization of the new method with two-element restrictions obtains the optimal p-center solution by solving a se...

A predictor-corrector method for solving the P (k)-matrix linear complementarity problems from infeasible starting points is analyzed. Two matrix factorizations and at most three backsolves are to be computed at each iteration. The computational complexity depends on the quality of the starting points. If the starting points are large enough then the algorithm has O ? (+ 1) 2 nL iteration compl...