Skip to content
#

exhaustive-search

Here are 40 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

MATLAB code implementations for Nonlinear Programming problems, covering methods like KKT conditions, optimization algorithms, genetic algorithms and penalty function approaches.

  • Updated May 9, 2024
  • MATLAB

Improve this page

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

Learn more