Reconstruction of large phylogenetic trees: A parallel approach


Reconstruction of phylogenetic trees for very large datasets is a known example of a computationally hard problem. In this paper, we present a parallel computing model for the widely used Multiple Instruction Multiple Data (MIMD) architecture. Following the idea of divide-and-conquer, our model adapts the recursive-DCM3 decomposition method [Roshan, U… (More)
DOI: 10.1016/j.compbiolchem.2005.06.003

13 Figures and Tables


  • Presentations referencing similar topics