Parallel computation of a maximum-likelihood estimator of a physical map.
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 that provides the motivation for parallel computing. Parallelization strategies for a maximum-likelihood estimation-based approach to physical map reconstruction are presented. The estimation procedure entails a gradient descent search for determining the optimal spacings between probes for a given probe ordering. The optimal probe ordering is determined using a stochastic optimization algorithm such as simulated annealing or microcanonical annealing. A two-level parallelization strategy is proposed wherein the gradient descent search is parallelized at the lower level and the stochastic optimization algorithm is simultaneously parallelized at the higher level. Implementation and experimental results on a distributed-memory multiprocessor cluster running the parallel virtual machine (PVM) environment are presented using simulated and real hybridization data.
Department of Computer Science, The University of Georgia, Athens, Georgia 30602-7404, USA. suchi@cs.uga.edu
S M
SM
Bhandarkar
S A
SA
Machaka
S S
SS
Shete
R N
RN
Kota
D000465:Algorithms; D003198:Computer Simulation; D016681:Genome, Fungal; D016013:Likelihood Functions; D015233:Models, Statistical; D008962:Models, Theoretical; D009492:Neurospora crassa / Q000235:genetics; D009693:Nucleic Acid Hybridization; D020161:Physical Chromosome Mapping / Q000379:methods*; D012984:Software; D013997:Time Factors