Ultrafast Sample Placement on Existing Trees
-
Updated
Mar 6, 2024 - C++
#
maximum-parsimony
Here are 8 public repositories matching this topic...
Tools for analyzing and comparing SARS-CoV-2 phylogenies
-
Updated
Nov 21, 2020 - C++
Run and compare algorithms for phylogenetic reconciliation and super-reconciliation
-
Updated
Apr 2, 2024 - Python
UPGMA Trait-Based Phlyogenetic Tree Generator With Optional Parsimony Capabilities
-
Updated
Oct 6, 2021 - Java
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
McGill University - Computational Biology Methods and Research Project
-
Updated
Apr 17, 2021 - Python
ExactMP: An Efficient Parallel Exact Solver for Phylogenetic Tree Reconstruction Using Maximum Parsimony
-
Updated
Dec 27, 2020 - C
Web App for constructing phylogenetic trees using various clustering methods and algorithms.
phylogenetic-trees
phylogenetics
evolutionary-algorithms
neighbor-joining
upgma-clustering
distance-matrix
maximum-parsimony
clustering-trees
-
Updated
Apr 10, 2024 - Python
Improve this page
Add a description, image, and links to the maximum-parsimony topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the maximum-parsimony topic, visit your repo's landing page and select "manage topics."