Skip to content
#

bound-search

Star

Here is 1 public repository matching this topic...

jasnap / philogenetic_trees

Star 1

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

Improve this page

Add a description, image, and links to the bound-search 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 bound-search topic, visit your repo's landing page and select "manage topics."

Learn more