Parallel Monte Carlo methods for physical mapping of chromosomes

Reconstructing a physical map of a chromosome from a genomic library presents a central computational problem in genetics. Physical map reconstruction in the presence of errors is a problem of high computational complexity. Parallel Monte Carlo methods for a maxi I mum likelihood estimation-baked approach to physical map reconstruction are presented. The estimation procedure entails gradient descent search for determining the optimal spacings between probes for a given probe ordering. The optimal probe ordering is determined using a simulated-Monte Carlo algorithm. A two-tier parallelization. strategy is proposed wherein the gradient descent search is parallelized at the lower level and the simulated Monte Carlo algorithm is simultaneously parallelized at the higher level. Implementation and experimental results on a network of shared-memory symmetric multiprocessors (SMPs) are presented.