Parallel and sequential algorithms for finding philogenetic trees using Maximum Parsimony. The scoring algorithm used is Fitch scoring algorithm. Exhaustive search and Branch and Bound search algorithms are implemented in sequential variant. SPMD method is used in parallel implementation.
matlab parallel branch-and-bound scoring-algorithm exhaustive-search fitch-scoring-algorithm bound-search philogenetic-trees maximum-parsimony
- Updated
Oct 2, 2017 - MATLAB