Skip to content
#

branch-and-bound

Here are 6 public repositories matching this topic...

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.

  • Updated Oct 2, 2017
  • MATLAB

Improve this page

Add a description, image, and links to the branch-and-bound topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the branch-and-bound topic, visit your repo's landing page and select "manage topics."

Learn more